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
68
69
70
71
72
73
74
75
76
77
#include <stdio.h>
#include <time.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <map> 
#include <string>
#include <vector>  
#include <iostream> 
#include <sstream> 
#include <queue>
#include <algorithm>
#include <assert.h>


using namespace std;

#define ll long long
#define PB 		push_back
#define FOR(a,start,end) 	for(int a=int(start); a<int(end); a++)
#define INF 		INT_MAX
#define SORT(a) 	sort(a.begin(),a.end()) 
#define CL(a,x) 		memset(a,x,sizeof(a))
#define REP(a,x)	for(int a=0;a<x;a++)
#define REP1(a,x)	for(int a=1;a<=x;a++)
#define MP 		make_pair



typedef vector<ll>     vi;
typedef pair<ll, ll>     pii;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vector<ll> > vvi;
typedef vector<vector<string> > vvs;
typedef vector<pair<string, string> > vss;
typedef pair<string, string> pss;
typedef pair<ll, pii> ppii;
typedef vector<ppii> vppii;
typedef vector<vector<pii> > vvii;
typedef vector<vvi> vvvi;


ll n, k, a, b, c, i, j, q, t;
vi vk, va, vb, vk1, vk2;

int main() {
	//	freopen( "c:\\wojtek\\uva\\pa\\debug\\ban10.in", "rt", stdin);  

		//pi=2*acos(0.0);
	//while(1){
	cin >> n ;
	vk.clear();
	while (n > 0) {
		vk.push_back(n % 10);
		n /= 10;
	}
	va.assign(20,0);
	va[0]=vk[0] + 1;
	for (int i = 1; i < vk.size(); i++) {
		va[i] = (vk[i] + 1)*va[i - 1];
		if (vk[i] == 1) {
			if (i == 1)
				va[i] += 19 - (10+vk[i-1]);
			else {
				va[i] += (19 - (10+vk[i-1]))*(va[i - 2]);
			}
		}
	}
	
	cout << va[(int)vk.size()-1] << endl;


	//}
	return 0;

}