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
65
66
67
// Artur Kraska, II UWr

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <list>
#include <set>
#include <map>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(typeof(coll.begin()) iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(typeof(coll.rbegin()) iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007

using namespace std;

long long n, tab[107], byl[107];

void ruszaj(long long n, int id)
{
    //cout << "odpala sie z id " << id << endl;
    if(n == 0)
    {
        tab[id] = 1;
        byl[id] = 1;
        return ;
    }
    if(!byl[id+1])
    {
        ruszaj(n/10, id+1);
    }


    long long res = tab[id+1]*(n%10+1);
    if(n%100 >= 10 && n%100 <= 18)
    {
        res += tab[id+2]*(19-n%100);
    }

    byl[id] = 1;
    tab[id] = res;
//    cout << "res[" << id << "] = " << res << endl;
}

int main()
{
    scanf("%lld", &n);
    ruszaj(n, 0);
    printf("%lld\n", tab[0]);

    return 0;
}