#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

void solve() {
	string x, y, z;
	cin >> x >> y >> z;
	set<string> st;
	rep(i, 0, x.size()) rep(j, 0, y.size()) rep(k, 0, z.size()) {
		vector<string> t;
		t.push_back(x.substr(0, i + 1));
		t.push_back(y.substr(0, j + 1));
		t.push_back(z.substr(0, k + 1));
		sort(all(t));
		do {
			string s;
			for (auto tt : t) s += tt;
			st.insert(s);
		} while (next_permutation(all(t)));
	}
	cout << st.size() << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	// cin >> t;
	while (t--) solve();
}