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
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define JOIN_(X, Y) X##Y
#define JOIN(X, Y) JOIN_(X, Y)
#define TMP JOIN(tmp, __LINE__)
#define PB push_back
#define SZ(x) int((x).size())
#define REP(i, n) for (int i = 0, TMP = (n); i < TMP; ++i)
#define FOR(i, a, b) for (int i = (a), TMP = (b); i <= TMP; ++i)
#define FORD(i, a, b) for (int i = (a), TMP = (b); i >= TMP; --i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef unsigned int uint;

const int INF = 1e9 + 9;

struct Case {
  void solve() {
    string a, b, c;
    cin >> a >> b >> c;
    int n = SZ(a);
    vi t(n);
    REP(i, n) { t[i] = (a[i] - '0') + (b[i] - '0') - (c[i] - '0'); }

    // GROUPS
    vector<bool> groups;
    bool start = false, cont = false;
    DEB("t: ");
    REP(i, n) {
      DEB(t[i] << " ");
      if (t[i] == 0) {
        if (start or cont) {
          groups.PB(false);
        }
        groups.PB(true);
        start = cont = false;
        continue;
      }
      if (t[i] == -1) {
        if (not start and not cont) {
          start = true;
          continue;
        }
        groups.PB(false);
        start = true;
        continue;
      }
      if (t[i] == 9) {
        if (start) {
          cont = true;
          continue;
        }
        groups.PB(false);
        start = cont = false;
        continue;
      }
      if (t[i] == 10) {
        if (start) {
          groups.PB(true);
          start = cont = false;
          continue;
        }

        groups.PB(false);
        start = cont = false;
        continue;
      }
      start = cont = false;
      groups.PB(false);
    }
    DEB("\n");

    // RESULT
    ll result = 0;
    ll current = 0;
    DEB("groups: ");
    for (bool group : groups) {
      DEB(int(group) << " ");
      if (group) {
        ++current;
      } else {
        if (current > 0) {
          result += current * (current + 1) / 2;
        }
        current = 0;
      }
    }
    DEB("\n");
    if (current > 0) {
      result += current * (current + 1) / 2;
    }


    cout << result << "\n";
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int z = 1;
  // cin >> z;
  while (z--) {
    Case().solve();
  }
}