#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,g,n) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  vector<string> s(3);
  rep(i,0,3) cin >> s[i];
  sort(all(s));
  set<string> st;
  do {
    string x = s[0], y = s[1], z = s[2];
    rep(i,1,len(x)+1) rep(j,1,len(y)+1) rep(k,1,len(z)+1) {
      st.emplace(x.substr(0, i)+y.substr(0, j)+z.substr(0, k));
    }
  } while(next_permutation(all(s)));
  // for (auto e : st) cout << e << endl;
  cout << len(st) << endl;
  return 0;
}