#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct pair_hash{
size_t operator()(const pair<int,int>&x)const{
return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
}
};
string s;
pair<pii, int> dfs(int ind){
if(s[ind] == '?'){
return mp(mp(0, 0), 1);
}
string type = "";
if(s[ind + 1] == 'i'){
type = "min";
}else{
type = "max";
}
pair<pii, int> ret1 = dfs(ind + 4);
pair<pii, int> ret2 = dfs(ind + 5 + ret1.se);
//cerr << "==== " << ind << ' ' << type << '\n';
// cerr << ret1 << ' ' << ret2 << '\n';
pair<pii, int> res;
res.se = ret1.se + ret1.se + 6;
if(type == "min"){
res.fi.fi = min(ret1.fi.fi, ret2.fi.fi);
res.fi.se = ret1.fi.se + ret2.fi.se + 1;
}else{
res.fi.fi = ret1.fi.fi + ret2.fi.fi + 1;
res.fi.se = min(ret1.fi.se, ret2.fi.se);
}
//cerr << res << '\n';
return res;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> s;
pii ans = dfs(0).fi;
int cnt = 0;
for(auto c : s){
if(c == '?'){
cnt++;
}
}
cout << cnt - ans.fi - ans.se << '\n';
return 0;
}
