#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
template<class T> void check_min(T &a, const T &b){ a = (a < b) ? a : b; }
template<class T> void check_max(T &a, const T &b){ a = (a > b) ? a : b; }
#define all(x) (x).begin(), (x).end()

struct Node{
    bool question_mark;
    Node *l, *r;
    bool is_max;

    Node(bool question_mark, bool is_max): question_mark(question_mark), is_max(is_max){} 
};

array<int, 3> solve(Node *node){
    if(node->question_mark){
        return {1, 1, 1};
    }
    auto [l1, r1, n1] = solve(node->l);
    auto [l2, r2, n2] = solve(node->r);
    if(node->is_max)
        return {l1 + l2, max(n1 + r2, n2 + r1), n1 + n2};
    return {min(l1, l2), r1 + r2 - 1, n1 + n2};
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    string s;
    cin >> s;

    int i = 0;
    stack<pair<Node*, int>> st;
    Node *root = nullptr;

    while(i < (int)s.size()){
        if(s[i] == '(' || s[i] == ','){
            i += 1;
            continue;
        }
        if(s[i] == ')'){
            i += 1;
            while(!st.empty() && st.top().second == 2)
                st.pop();
            continue;
        }
        if(s[i] == '?'){
            i += 1;

            auto new_node = new Node(true, false);
            if(!root){
                root = new_node;
            }

            if(!st.empty()){
                if(st.top().second == 0)
                    st.top().first->l = new_node;
                else
                    st.top().first->r = new_node;
                st.top().second += 1;
            }
            continue;
        }
        if(s.substr(i, 3) == "min"){
            i += 3;

            auto new_node = new Node(false, false); 
            if(st.empty()){
                st.push({new_node, 0});
                root = new_node;
                continue;
            }
            if(st.top().second == 0){
                st.top().first->l = new_node;
                ++st.top().second;
            }
            else{
                st.top().first->r = new_node;
                ++st.top().second;
            }

            st.push({new_node, 0});
            continue;
        }
        if(s.substr(i, 3) == "max"){
            i += 3;

            auto new_node = new Node(false, true); 
            if(st.empty()){
                st.push({new_node, 0});
                root = new_node;
                continue;
            }
            if(st.top().second == 0){
                st.top().first->l = new_node;
                ++st.top().second;
            }
            else{
                st.top().first->r = new_node;
                ++st.top().second;
            }

            st.push({new_node, 0});
            continue;
        }
    }

    auto [l, r, n] = solve(root);
    cout << r - l + 1 << "\n"; 
}