#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INFL = 1e17+7;
const long long INFI = 1e9+7;
const long long MOD = 1e9+7;
const double EPS = 1e-8;
const double PI=acos(-1);

using namespace std;


int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	string r,g,b;
	cin >> r >> g >> b;
	vector<int> R(16,0),G(16,0),B(16,0);
	
	for(int i=0;i<r.size();i++){
		if('0'<=r[i] && r[i]<='9'){
			R[(int)(r[i]-'0')]=1;
		}else if('A'<=r[i] && r[i]<='F'){
			if(r[i]=='A')R[10]=1;
			if(r[i]=='B')R[11]=1;
			if(r[i]=='C')R[12]=1;
			if(r[i]=='D')R[13]=1;
			if(r[i]=='E')R[14]=1;
			if(r[i]=='F')R[15]=1;
		}
	}
	
	for(int i=0;i<g.size();i++){
		if('0'<=g[i] && g[i]<='9'){
			G[(int)(g[i]-'0')]=1;
		}else if('A'<=g[i] && g[i]<='F'){
			if(g[i]=='A')G[10]=1;
			if(g[i]=='B')G[11]=1;
			if(g[i]=='C')G[12]=1;
			if(g[i]=='D')G[13]=1;
			if(g[i]=='E')G[14]=1;
			if(g[i]=='F')G[15]=1;
		}
	}		
	
	for(int i=0;i<b.size();i++){
		if('0'<=b[i] && b[i]<='9'){
			B[(int)(b[i]-'0')]=1;
		}else if('A'<=b[i] && b[i]<='F'){
			if(b[i]=='A')B[10]=1;
			if(b[i]=='B')B[11]=1;
			if(b[i]=='C')B[12]=1;
			if(b[i]=='D')B[13]=1;
			if(b[i]=='E')B[14]=1;
			if(b[i]=='F')B[15]=1;
		}
	}
	
	int cnt_r=0;
	for(int i=0;i<R.size();i++){
		if(R[i]==0)cnt_r++;
	}
	if(r=="NONE")cnt_r=16;
	
	int cnt_g=0;
	for(int i=0;i<G.size();i++){
		if(G[i]==0)cnt_g++;
	}
	if(g=="NONE")cnt_g=16;
	
	int cnt_b=0;
	for(int i=0;i<B.size();i++){
		if(B[i]==0)cnt_b++;
	}
	if(b=="NONE")cnt_b=16;
	
	long long ans=cnt_r*cnt_r*cnt_g*cnt_g*cnt_b*cnt_b;
	cout << ans << endl;
	
	return 0;
}