#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class S, class T,class U,class V,class W> ostream& operator<<(ostream &os, const tuple<S,T,U,V,W> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<","<<get<4>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
const ll MOD=1e9+7;
const ll INF=3e9;

ll eval(string s){
	ll ok=1;
	int n=s.size();
	int i=0;
	function<ll()> E,T,F,N;
	E=[&](){
			if(i==n) return ok=0;
			ll re=0;
			ll sgn=1,tmp;
			while(1){
				re+=sgn*T();
				if(i<n){
					if(s[i]=='+'){
						sgn=1;
					}else if(s[i]=='-'){
						sgn=-1;
					}else{
						break;
					}
					++i;
				}else break;
			}
			return re;
		};
	T=[&](){
			if(i==n) return ok=0;
			ll re=1,tmp;
			while(1){
				re*=F();
				if(i==n || s[i]!='*') break;
				++i;
			}
			return re;
		};
	F=[&](){
			if(i==n) return ok=0;
			if(s[i]=='('){
				++i;
				ll tmp=E();
				if(s[i]!=')') return ok=0;
				++i;
				return tmp;
			}else if(s[i]=='-'){
				++i;
				return -F();
			}else{
				if(s[i]=='0'){
					if(i+1<n && isdigit(s[i+1])) return ok=0;
				}else if(s[i]!='1') ok=0;
				ll re=0;
				while(i<n && isdigit(s[i])){
					re*=2;
					if(s[i]=='1') ++re;
					++i;
				}
				return re;
			}
		};
	ll re=E();
	// out(s,re,1);
	if(ok && i==n) return re;
	else return INF;
}

int main(){
	// out(eval("1"),1);
	// out(eval("1+1"),1);
	// out(eval("1+1101"),1);
	// out(eval("10*1+1101"),1);
	// out(eval("-0"),eval("0"),1);
	// out(eval("0*"),1);
	// return 0;
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
	// cout<<INF*INF<<endl;
	string s;
	cin>>s;
	string opes="01+-*()=";
	string cs;
	for(char c:s)if(isalpha(c)) cs+=c;
	sort(all(cs)); UNIQUE(cs);
	cs.resize(opes.size(),'.');
	sort(all(cs));
	int re=0;
	do{
		string str=s;
		rep(i,opes.size())for(char &c:str)if(c==cs[i]) c=opes[i];
		int cnt=0,pos;
		rep(i,str.size())if(str[i]=='=') ++cnt, pos=i;
		if(cnt!=1 || str[0]=='=' || str.back()=='=') continue;
		string A=str.substr(0,pos);
		string B=str.substr(pos+1);
		ll a=eval(A);
		ll b=eval(B);
		if(a!=INF && b!=INF && a==b) ++re;
		if(a!=INF && b!=INF && a==b) out(A,B,a,b,cs,opes,1);
	}while(next_permutation(all(cs)));
	cout<<re<<endl;
  return 0;
}

