#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sort undefined_function // To use stable_sort instead sort
#define bpc __builtin_popcount
#define ull unsigned long long
#define ld double
#define ll long long
#define mp make_pair
#define F first
#define S second
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace __gnu_pbds;
using namespace std;
typedef tree<long long, null_type, less_equal<long long>,
rb_tree_tag, tree_order_statistics_node_update> Tree;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll INF = 9223372036854775807LL;
const ll inf = 2147483647;
const ll MOD = 998244353; //[998244353, 1e9 + 7, 1e9 + 13]
const ld PI = acos(-1);
const ll NROOT = 800;
ll binpow(ll a, ll b, ll _MOD = -1) {
if (_MOD == -1)
_MOD = MOD;
ll res = 1;
for (; b; b /= 2, a *= a, a %= _MOD)
if (b & 1) res *= a, res %= _MOD;
return res;
}
void set_IO(string s) {
#ifndef LOCAL
string in = s + ".in";
string out = s + ".out";
freopen(in.c_str(), "r", stdin);
freopen(out.c_str(), "w", stdout);
#endif
}
bool dataOverflow(ll a, ll b) {return (log10(a) + log10(b) >= 18);}
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a * b / gcd(a, b);}
ll ceil(ll a, ll b) {return (a + b - 1) / b;}
ll invmod(ll a) {return binpow(a, MOD - 2);}
string s;
vector<int> p, v;
int calc(int l, int r) {
if (s[l] == 'm') {
int comma = -1, cnt = 0;
for (int i = l + 4; i < r; i ++) {
if (s[i] == ',' && cnt == 0) {
comma = i;
break;
}
if (s[i] == '(')
cnt ++;
if (s[i] == ')')
cnt --;
}
if (s[l + 1] == 'i') { // MIN
return min(calc(l + 4, comma - 1), calc(comma + 1, r - 1));
} else { // MAX
return max(calc(l + 4, comma - 1), calc(comma + 1, r - 1));
}
} else { // ?
return v[p[l]];
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> s;
p.resize(s.size(), -1);
int n = 0;
for (int i = 0; i < s.size(); i ++) {
if (s[i] == '?') {
p[i] = n;
n ++;
}
}
v.resize(n);
for (int i = 0; i < n; i ++)
v[i] = i + 1;
set<int> ans;
do {
ans.insert(calc(0, s.size() - 1));
} while (next_permutation(v.begin(), v.end()));
cout << ans.size() << "\n";
dbg(ans);
return 0;
}
