// Skyqwq
#include <bits/stdc++.h>
 
#define pb push_back
#define fi first
#define se second
#define mp make_pair
 
using namespace std;
 
typedef pair<int, int> PII;
typedef long long LL;
 
template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }
 
template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}
 
const int N = 2e6 + 5, INF = 1e9;
 
string str;
 
vector<int> g[N];
 
int idx, op[N], s[N], top, n, tot, rt;
 
PII I = mp(INF, -INF);
 
PII inline mg(PII a, PII b) {
	return mp(min(a.fi, b.fi), max(a.se, b.se));
}
 
PII inline add(PII a, PII b) {
	return mp(a.fi + b.fi, a.se + b.se);
}
 
PII inline apd(PII a, int b) {
	return mp(a.fi, a.se + b);
}
 
PII f[N][2];
 
int sz[N];
 
void dfs1(int u) {
	sz[u] = u <= n ? 1 : 0;
	if (u <= n) {
		f[u][0] = mp(1, 1);
		f[u][1] = mp(0, 0);
		return;
	}
	for (int v: g[u]) {
		dfs1(v);
		sz[u] += sz[v];
	}
	int A = g[u][0], B = g[u][1];
	if (op[u] == 0) {
		f[u][0] = mg(apd(f[A][0], sz[B]), apd(f[B][0], sz[A]));
		f[u][1] = add(f[A][1], f[B][1]);
	} else {
		f[u][1] = mg(apd(f[A][1], sz[B]), apd(f[B][1], sz[A]));
		f[u][0] = add(f[A][0], f[B][0]);
	}
	// cerr << u << " " << A << " " << B << " ----:::\n";
	// for (int i = 0; i < 2; i++) {
	// 	cerr << f[u][i].fi << " " << f[u][i].se << " ---\n";
	// }
}
 
PII ret = I;
 
int c[N];
 
void dfs2(int u, PII now) {
	if (u <= n) {
		c[now.fi]++, c[now.se + 1]--;
		return;
	}
	for (int i = 0; i < 2; i++) {
		dfs2(g[u][i], add(now, f[g[u][i ^ 1]][op[u] == 0 ? 1 : 0]));
	}
}	
 
int main() {
    cin >> str;
    for (char c: str) if (c == '?') ++n; idx = n;
    rt = idx + 1;
    for (int i = 0; i < str.size(); i++) {
    	if (str[i] == '(') {
    		s[++top] = ++idx;
    		if (top > 1) g[s[top - 1]].pb(s[top]);
    		op[idx] = str[i - 1] == 'n' ? 0 : 1;
    	} else if (str[i] == ')') {
    		--top;
    	} else if (str[i] == '?') {
    		++tot;
    		assert(top);
    		g[s[top]].pb(tot);
    	}
    }
    dfs1(rt);
    dfs2(rt, mp(0, 0));
    int ans = 0;
    //cerr << ret.fi << " -- " << ret.se << endl;
    for (int i = 0; i < n; i++) {
    	if (i) c[i] += c[i - 1];
    	if (c[i]) ans++;
    }
    printf("%d\n", ans);
    return 0;
}