#include <iostream>
#include <stack>

using namespace std;

const int N = 1e6 + 5; 

int n, tot, f[N], g[N];
stack<int> ns, os; 

int main () {
  cin.tie(0)->sync_with_stdio(0);
  string s;
  cin >> s;
  for (auto c : s) 
    n += c == '?';
  for (int i = 0; i < s.size(); ++i) {
    if (s[i] == 'm') {
      os.push(s[i + 1] == 'a');
    }
    else if (s[i] == '?') {
      ++tot, f[tot] = 1, g[tot] = n; 
      ns.push(tot); 
    }
    else if (s[i] == ')') {
      int v = ns.top();
      ns.pop();
      int u = ns.top();
      if (!os.top()) {
        f[u] = min(f[u], f[v]);
        g[u] = g[u] + g[v] - n - 1; 
      }
      else {
        f[u] = f[u] + f[v];
        g[u] = max(g[u], g[v]);
      }
      os.pop();
    }
  }
  cout << g[1] - f[1] + 1 << '\n';
  return 0; 
}