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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
typedef long long ll;
typedef vector<ll> vll;
const int MOD = 998244353;

#define rep(x, b, e) for(int x=(b); x<(e); ++x)
#define trav(a, x) for(auto& a : x)
#define ford(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define all(c) c.begin(),c.end()
#define sz(x) ((int)((x).size()))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
#define mp(x,y) make_pair(x,y)
typedef short int sint;
template<typename T> bool ckmin(T& a, const T& b){return b<a?a=b,1:0;}
template<typename T> bool ckmax(T& a, const T& b){return b>a?a=b,1:0;}

struct DSU {
  vi p, roz;
  DSU(int n) : p(n), roz(n, 1) { iota(all(p), 0); }
  int find(int x) { return p[x] == x ? x : p[x] = find(p[x]); }
  bool unite(int a, int b) {
    a = find(a); b = find(b);
    if (a == b) return false;
    if (roz[a] < roz[b]) swap(a, b);
    p[b] = a; roz[a] += roz[b]; return true;
  }
  bool same(int a, int b) { return find(a) == find(b); }
};

template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(char c) {
  return string(1, c);
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif


// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353; // modint1000000007;
// typedef vector<mint> vmi;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); // use rng() to get unsigned int
// mt19937_64 for random long longs

void solve() {
	
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	string sa, sb, sc;
  cin >> sa >> sb >> sc;
  int n = sz(sa);
  auto conv = [&](const string& x) {
    vi ans(n);
    rep(i, 0, n) {
      ans[i] = x[i] - '0';
    }
    return ans;
  };
  vi a = conv(sa), b = conv(sb), c = conv(sc);
  
  vi ile(n + 1), pos(n + 1), cnt4(n + 1), prev3(n + 1);
  rep(i, 0, n) {
    if ((a[i] + b[i] + 1)  == c[i]) {
      pos[i + 1] = 3;
    } else if ((a[i] + b[i] + 1) % 10 == c[i]) {
      pos[i + 1] = 4;
    } else if (a[i] + b[i] == c[i]) {
      pos[i + 1] = 1;
    } else if ((a[i] + b[i]) % 10 == c[i]) {
      pos[i + 1] = 2;
    }
    cnt4[i + 1] = cnt4[i] + (pos[i + 1] == 4);
    prev3[i + 1] = prev3[i];
    if (pos[i + 1] == 3) {
      prev3[i + 1] = i + 1;
    }
  }
  pos[0] = 1;
  rep(i, 1, n + 1) {
    if (pos[i] == 1) {
      ile[i] = ile[i - 1] + 1;
    } else if (pos[i] == 2) {
      // have carry
      int p3 = prev3[i];
      if (p3 == 0) continue;
      int fours = cnt4[i] - cnt4[p3];
      if (fours == (i - 1) - p3) {
        ile[i] = 1 + ile[p3 - 1];
      }
    }
  }
  ll ans = 0;
  rep(i, 1, n + 1) ans += ile[i];
  cout << ans << endl;
}