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
#include <iostream>

using namespace std;

int P[2][20];
long long sum = 0;

void rec(int i, long long pro) {
    if (i < 0) {
        sum += pro;
    } else {
        rec(i-1, pro * P[0][i]);
        
        if (i > 0 && P[1][i] != 0) {
            rec(i-2, pro * P[1][i]);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    string n;
    cin >> n;
    
    int len = n.size();
    
    for (int i=len-1; i>0; i--) {
        P[0][i] = n[i] - '0' + 1;
        
        if (n[i-1] == '1' && n[i] <= '8') {
            P[1][i] = '9' - n[i];
        }
    }
    
    P[0][0] = n[0] - '0' + 1;
    
    rec(len-1, 1);
    
    cout << sum << '\n';
    
    return 0;
}