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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <stack>
#include <list>
#include <queue>
#include <deque>
#include <cctype>
#include <string>
#include <vector>
#include <sstream>
#include <iterator>
#include <numeric>
#include <cmath>
using namespace std;

typedef vector <int > VI;
typedef vector < VI > VVI;
typedef long long LL;
typedef vector < LL > VLL;
typedef vector < double > VD;
typedef vector < string > VS;
typedef pair<int,int> PII;
typedef vector <PII> VPII;
typedef istringstream ISS;

#define ALL(x) x.begin(),x.end()
#define REP(i,n) for (int i=0; i<(n); ++i)
#define FOR(var,pocz,koniec) for (int var=(pocz); var<=(koniec); ++var)
#define FORD(var,pocz,koniec) for (int var=(pocz); var>=(koniec); --var)
#define FOREACH(it, X) for(__typeof((X).begin()) it = (X).begin(); it != (X).end(); ++it)
#define PB push_back
#define PF push_front
#define MP(a,b) make_pair(a,b)
#define ST first
#define ND second
#define SIZE(x) (int)x.size()

const int N = 1000*1000+7;
char a[N], b[N], c[N];

int main(){
	scanf("%s", a); scanf("%s", b); scanf("%s", c);
	long long res = 0;
	int ile = 0;
	int trzeba = 0;
	for (int i = 0; a[i]; ++i) {
		int x = a[i] - '0';
		int y = b[i] - '0';
		int z = c[i] - '0';
		int ok = 0, trzeba2 = 0, daje = 0;
		if (x + y == z) { ok = 1; trzeba2 = 0; daje = 0; }
		if (x + y == z + 10) { ok = 1; trzeba2 = 0; daje = 1; }
		if (x + y + 1 == z) { ok = 1; trzeba2 = 1; daje = 0; }
		if (x + y + 1 == z + 10) { ok = 1; trzeba2 = 1; daje = 1; }
		if (ok) {
			if (daje == trzeba) {
				if (daje == 0) ile++;
				if (trzeba2 == 0) res += (long long)ile;
				trzeba = trzeba2;
			} else {
				ile = 0;
				if (daje == 0) ile++;
				if (trzeba2 == 0) res += (long long)ile;
				trzeba = trzeba2;
			}
		} else {
			ile = 0; trzeba = 0;
		}
	}
	cout << res << endl;
	return 0;
}