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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#include<bits/stdc++.h>

#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 VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)


#define VI vector<int>
#define PII pair<int,int>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define lint long long int


#define debug(x) {cerr <<#x <<" = " <<x <<endl; }
#define debug2(x,y) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y <<endl; }
#define debug3(x,y,z) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y << ", " << #z << " = " << z <<endl; }
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<endl; }}
#define debugt(t,n) {{cerr <<#t <<" = "; FOR(it,0,(n)) cerr <<t[it] <<", "; cerr <<endl; }}


#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue


#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));


using namespace std;

char s1[1000005];
char s2[1000005];
char s3[1000005];

/*
dp[i] = {konczące się na i}
dp2[i] = { niby dobre ale dające przeskok}
dp[i] = {a+b=c => dp[i] = dp[i-1] + 1,
         a+b=c-1 => dp[i] = dp2[i-1]}
dp2[i] = {a+b=10+c => dp2[i] = dp[i-1]}
         {a+b=9+c => dp2[i] = dp2[i+1]}
*/

int dp[1000005];
int dp2[1000005];


int main() {
	scanf("%s", s1);
	scanf("%s", s2);
	scanf("%s", s3);
	int n = strlen(s1);
	
	dp[n] = 0;
	dp2[n] = 0;
	for (int i = n-1; i >= 0; i--) {
		int a = s1[i] - '0';
		int b = s2[i] - '0';
		int c = s3[i] - '0';

		dp[i] = dp2[i] = 0;
		if (a + b == c) {
			dp[i] = dp[i+1] + 1;
		}
		if (a + b + 1 == c) {
			dp[i] = dp2[i+1];
		}
		if (a+b == 10 + c) {
			dp2[i] = dp[i+1] + 1;
		}
		if (a+b == 9 + c) {
			dp2[i] = dp2[i+1];
		}
	}
	lint sum = 0;

	FOR(i,0,n) {
//		cout << dp[i] << " ";
		sum += dp[i];
	}
//	cout << endl;
	printf("%lld\n", sum);
}