#include <bits/stdc++.h>
using namespace std;
#define int ll
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{" << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
#define reach cerr << "LINE: " << __LINE__ << "\n";
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = 10000005;
int sum[MAXN];
vector<int> V[MAXN];
string str;
int dpdpmin(int st, int en) {
if(st==en && str[st]=='?')return 1;
auto it=upper_bound(all(V[sum[st]-1]),st);
if(str[st]=='m' && str[st+1]=='a' && str[st+2] == 'x') {
return dpdpmin(st+4,*it-1) + dpdpmin(*it+1,en-1);
} else {
return min(dpdpmin(st+4,*it-1) , dpdpmin(*it+1,en-1));
}
}
int dpdpmax(int st, int en) {
if(st==en && str[st]=='?')return 1;
auto it=upper_bound(all(V[sum[st]-1]),st);
if(str[st]=='m' && str[st+1]=='i' && str[st+2] == 'n') {
return dpdpmax(st+4,*it-1) + dpdpmax(*it+1,en-1);
} else {
return min(dpdpmax(st+4,*it-1) , dpdpmax(*it+1,en-1));
}
}
int32_t main()
{
IAMSPEED
cin >> str;
int n=0;
FOR(i,0,str.size()-1) {
if(str[i]=='?')++n;
if(i)sum[i]=sum[i-1];
if(str[i]=='m'){
sum[i]+=1;
V[sum[i]].pb(i);
db(i);
}
if(str[i]==','){
sum[i]+=-1;
V[sum[i]].pb(i);
db(i);
}
}
dba(sum,0,str.size()-1);
int mn=dpdpmin(0,str.size()-1);
int mx=dpdpmax(0,str.size()-1);
int mnpossible=mx;
int mxpossible=n-mn+1;
cout << mxpossible-mnpossible+1;
}
