#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define ff first
#define ss second
using namespace std;
string s;
int n;
int cur = 0;
vector<int>test;
struct node{
	node *L, *R;
	int idx;
	bool isMax;
	bool isHoja;
	node (int l, int r){
		if(r == l){
			//cout << "hoja " << endl;
			idx = cur ++ ;
			isHoja = true;
		}else{
			isHoja = false;
			int cuenta = 0;
			int l2 = 0;
			isMax = s[l+1] == 'a';
			//cout<< "ismax: " << isMax << endl;
			l += 4;
			for(int i = l ; i <= r ; i ++){
				if(cuenta == 0 and s[i] == ','){
					//cout << "left: " << endl;
					L = new node(l, i-1);
					l2 = i + 1;
					break;
				}else if(s[i] == '(')cuenta ++;
				else if(s[i] == ')')cuenta -- ;
			}
			//cout << "right " << endl;
			R = new node(l2, r-1);
		}
	}
	int process(){
		if(isHoja)return test[idx];
		else if(isMax)return max(L->process(), R->process());
		else return min(L->process(), R->process());
	}
	
	
};

node *root;
int main(){
	ios::sync_with_stdio(NULL);
	cin.tie(0);
	cout.tie(0);
	#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	#endif
	cin >> s;
	n = s.size();
	root = new node(0, n-1);

	for(int i = 0 ; i < cur ; i ++)test.pb(i+1);
	int posible[cur+2];
	memset(posible, false, sizeof posible);
	do{
		posible[root->process()] = true;
	}while(next_permutation(test.begin(), test.end()));
	int ans = 0;
	for(int i = 1 ; i <= cur + 1 ; i ++){
		if(posible[i])ans ++ ;
	}
	cout << ans << "\n";
	return 0;
}