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
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#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>
#include <set>


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;
typedef vector<bool> vl;


ll  n, k, q, d, r, g, b, z, p, a, c, m, t;

vi vk, va, vd, vk0, vc;
vl vb;
vvi vva, vvk, vvd;
vii vax, vcx;
vvii vvax, vvbx;
pii p1, p2;
string w;
vs vw;

priority_queue<pii > pq1, pq2;

int dod(int a, int b, int c) {
	if ((a + b) == c)
		return 0;
	if ((a + b - 10) == c)
		return 1;
	return -1;
}
int dodp(int a, int b, int c) {
	if ((a + b+1) == c)
		return 0;
	if ((a + b- 9) == c)
		return 1;
	return -1;
}
int main() {
	//freopen("c:\\wojtek\\uva\\pa\\debug\\t2.in", "rt", stdin);
	//freopen("c:\\cygwin64\\home\\plwokow\\.check_sol\\zb1\\in\\320.in", "rt", stdin);
	//d = 1000000007;
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	//while (1) {
		vw.clear();
		for (int i = 0; i < 3; i++) {
			cin >> w;
			vw.push_back(w);
		}
		n = (int)vw[0].size();
		va.assign(2, 0);
		vva.assign(n + 1, va);
		a = dod(vw[0].back() - '0', vw[1].back() - '0', vw[2].back() - '0');
		z = 0;
		if (a == 0) {
			vva[n - 1][0] = 1;
			z = 1;
		}
		else if (a == 1) {
			vva[n - 1][1] = 1;
		}
		for (int i = n - 2; i >= 0; i--) {

			a = dod(vw[0][i] - '0', vw[1][i] - '0', vw[2][i] - '0');
			if (a == 0) {
				vva[i][0] = 1;
				vva[i][0] += vva[i + 1][0];
			}
			if (a == 1) {
				vva[i][1] = 1;
				vva[i][1] += vva[i + 1][0];
			}
			a = dodp(vw[0][i] - '0', vw[1][i] - '0', vw[2][i] - '0');
			if (a == 0)
				vva[i][0] += vva[i + 1][1];
			else if (a == 1)
				vva[i][1] += vva[i + 1][1];
			z += vva[i][0];

		}
		cout << z << '\n';
	//}
	return 0;

}