1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <stdio.h>
#include <vector>
#include <map>
#include <unordered_set>
#include <queue>
#include <unordered_map>
#include <math.h>
#include <limits.h>
#include <algorithm>
#include <functional>
#include <iterator>
#include <algorithm>
#include <string>
#include <iostream>

using namespace std;

#define pb push_back
#define mp make_pair

typedef long long ll;
typedef unsigned long long ull;

using namespace std;

int T;
ll n;

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  // cin >> T;
  // while (T --> 0) {
  cin >> n;

    string ns = to_string(n);
    reverse(ns.begin(), ns.end());

    ll suma0 = 0, suma1 = 0;
    ll prev0 = 1, prev1 = 0;
    for (char c : ns) {
      ll ci = c - '0';
      if (ci > 1) {
        suma0 = prev0 * (ci + 1LL);
        suma1 = prev0 * (9LL - ci);
      } else if (ci == 1LL) {
        suma0 = prev1 + prev0 * 2LL;
        suma1 = prev0 * 8LL; // + prev1 * 2;
      } else {
        suma0 = prev0;
        suma1 = 9LL * prev0;
      }
      prev0 = suma0;
      prev1 = suma1;

    }


    cout << suma0 << endl;
  // }

  return 0;
}