#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
using db = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
#define f first
#define s second

#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT, size_t SZ > using AR = array<T, SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pi>;
using vpl = V<pl>;

#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define pb push_back
#define yes cout << "Y" << "e" << "s\n";
#define no cout << "N" << "o\n";

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = ((b)-1); i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)

const int MOD = 1e9+7;
const int MOD98 = 998244353;
const int MX = 1e9;
// const int INF = 1e18;
const db PI = acos((db)-1);
// const int dx[] = { 1,0,-1,0 };
// const int dy[] = { 0,1,0,-1 };
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
void setIO(string name = "") {
    ios_base::sync_with_stdio(0); cin.tie(0);
    if ((ll)(name.size())) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}
template<class T> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} 
template<class T> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
void _print(char i) { cerr << i; }
void _print(string i) { cerr << i; }
void _print(float i) { cerr << i; }
void _print(int i) { cerr << i; }
void _print(double i) { cerr << i; }
void _print() { cerr << "\n"; };
template<typename x, typename y> void _print(pair<x, y>& t) { cerr << "{";_print(t.first);cerr << ", ";_print(t.second);cerr << "},"; }
template<typename x> void _print(x& t) { cerr << "{"; for (int i = 0;i < (int)t.size();i++) { _print(t[i]); if (i < (int)t.size() - 1) cerr << ", "; } cerr << "}"; }
template<typename x, typename... y> void _print(x a, y... b) { _print(a);if (sizeof...(b)) cerr << ", ";_print(b...); }
#define dbg(x...) cerr<<"["<<#x<<"] = [";_print(x);cerr<<"]\n";
int test;

/*


*/

struct Opt{
    int op, cur, prev;
};

void solve(){

    str s; cin >> s;
    int n = 0;
    each(x, s){
        n += (x == '?');
    }
    str mini = "min(?,?)", maxi = "max(?,?)", t = s;
    vector<Opt> v;
    while(1){
        str tmp = "";
        F0R(i, sz(t)){
            if(t[i] == '?') v.pb({2, sz(tmp), i});
            if(i + 7){
                str x = t.substr(i, 8);
                if(x == mini || x == maxi){
                    // cout << (x == mini) << " " << i + 4 << "\n";
                    v.pb({x == maxi, sz(tmp), i + 4});
                    tmp += '?';
                    i += 7;
                }
                else tmp += t[i];
            }
            else tmp += t[i];
        }
        // cout << tmp << "\n";
        t = tmp;
        if(t == "?") break;
    }    

    vi a(n);
    iota(all(a), 1);
    // a = {1, 3, 2, 4, 5};
    vb res(n + 1, 0);
    do{

        vi c(sz(s), 0);
        int cnt = 0;
        F0R(i, sz(s)){
            if(s[i] == '?') c[i] = a[cnt++];
        }
        // each(x, c) cout << x << " ";
        // cout << "\n";
        each(x, v){
            // cout << x.op << " " << c[x.prev] << " " << c[x.prev + 2] << " " << x.cur << " " << x.prev << "\n";
            if(x.op == 1){
                c[x.cur] = max(c[x.prev], c[x.prev + 2]);
            }
            else if(x.op == 0){
                // cout << c[x.prev] << " " << c[x.prev + 2] << "\n";
                c[x.cur] = min(c[x.prev], c[x.prev + 2]);
            }
            else{
                c[x.cur] = c[x.prev];
            }
            // cout << c[x.cur] << "\n";
            // each(x, c) cout << x << " ";
            // cout << "\n";
        }
        if(!res[c[0]]){
            // cout << c[0] << "\n";
            // each(x, a) cout << x << " ";
            // cout << "\n";
        }
        res[c[0]] = 1;

    } while(next_permutation(all(a)));

    int ans = 0;
    FOR(i, 1, n + 1) ans += res[i];
    cout << ans << "\n";
}

signed main() {
    setIO("");
    int T = 1;
    // cin >> T;
    for (test = 1; test <= T; test++) {
        // cout << "Case #" << test << ": " << a.f << " " << a.s << "\n";
        solve();
    }
}