#include <bits/stdc++.h>
using namespace std;
void maketree(int &index, int &node, string &expression, vector<int> adj[], int type[])
{
if (expression[index]=='?')
{
type[node]=3;
return;
}
if (expression.substr(index, 3)=="min")
type[node]=1;
else
type[node]=2;
int currentnode=node;
index=index+4;
node=node+1;
adj[currentnode].push_back(node);
maketree(index, node, expression, adj, type);
while (expression[index]!=',')
index=index+1;
index=index+1;
node=node+1;
adj[currentnode].push_back(node);
maketree(index, node, expression, adj, type);
while (expression[index]!=')')
index=index+1;
if (index+1<expression.size() && index+1==',')
{
index=index+2;
node=node+1;
adj[currentnode].push_back(node);
maketree(index, node, expression, adj, type);
}
return;
}
int evalute(int node, vector<int> adj[], int type[], int value[])
{
if (type[node]==1)
return min(evalute(adj[node][0], adj, type, value), evalute(adj[node][1], adj, type, value));
if (type[node]==2)
return max(evalute(adj[node][0], adj, type, value), evalute(adj[node][1], adj, type, value));
if (type[node]==3)
return value[node];
}
int main()
{
string expression;
cin >> expression;
int index=0, node=0;
vector<int> adj[100];
int type[100];
maketree(index, node, expression, adj, type);
int i, j;
int n=0;
for (i=0; i<=node; i++)
if (type[i]==3)
n=n+1;
int permutation[n];
for (i=0; i<n; i++)
permutation[i]=i+1;
int value[node+1];
set<int> possiblevalues;
do {
j=0;
for (i=0; i<=node; i++)
if (type[i]==3)
{
value[i]=permutation[j];
j=j+1;
}
possiblevalues.insert(evalute(0, adj, type, value));
} while(next_permutation(permutation, permutation+n));
cout << possiblevalues.size();
return 0;
}
