#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));
/* -------------------- Typedefs -------------------- */
typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;
/* -------------------- Usings -------------------- */
using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
/* -------------------- Defines -------------------- */
#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);
/* -------------------- Constants -------------------- */
const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);
/* -------------------- Functions -------------------- */
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void precision(int x) {
cout.setf(ios::fixed | ios::showpoint);
cout.precision(x);
}
ll gcd(ll a, ll b) {
if (a == 0 || b == 0) return(max(a, b));
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
ll range_sum(ll a, ll b) {
if (a > b) return 0ll;
ll dif = a - 1, cnt = b - a + 1;
ll ans = ((b - a + 1) * (b - a + 2)) / 2;
ans += ((b - a + 1) * dif);
return ans;
}
string dec_to_bin(ll a) {
string s = "";
for (ll i = a; i > 0; ) {
ll k = i % 2;
i /= 2;
char c = k + 48;
s += c;
}
if (a == 0) {
s = "0";
}
reverse(all(s));
return s;
}
ll bin_to_dec(string s) {
ll num = 0;
for (int i = 0; i < s.size(); i++) {
num *= 2ll;
num += (s[i] - '0');
}
return num;
}
ll factorial_by_mod(ll n, ll mod) {
ll ans = 1;
ll num;
for (ll i = 1; i <= n; ++i) {
num = i % mod;
ans *= num;
ans %= mod;
}
return ans;
}
bool isPrime(ll a) {
if (a == 1) return false;
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0) return false;
}
return true;
}
ll binpow(ll a, ll b) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
}
b >>= 1;
a *= a;
}
return ans;
}
ll binpow_by_mod(ll a, ll b, ll mod) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
ans %= mod;
}
b >>= 1;
a *= a;
a %= mod;
}
return ans;
}
/* -------------------- Solution -------------------- */
vi type, leaf, p, cap;
vector<pii> child, ran;
int n, m = 1;
string s;
void make_node() {
type.pub(0);
leaf.pub(0);
p.pub(0);
cap.pub(0);
child.pub({ 0,0 });
ran.pub({ 1,1 });
}
pii uni(pii p1, pii p2) {
pii ret = p1;
if (ret.ff > p2.ff) ret.ff = p2.ff;
if (ret.ss < p2.ss) ret.ss = p2.ss;
return ret;
}
void dfs(int u = 1) {
if (leaf[u]) return;
int l1, r1, x1, l2, r2, x2, x;
int to = child[u].ff;
dfs(to);
l1 = ran[to].ff, r1 = ran[to].ss, x1 = cap[to];
to = child[u].ss;
dfs(to);
l2 = ran[to].ff, r2 = ran[to].ss, x2 = cap[to];
cap[u] = x1 + x2;
x = x1 + x2;
pii p1, p2;
if (type[u] == 0) {
p1 = { l1,min(x,r1 + r2 - 1) };
p2 = { l2,min(x,r2 + r1 - 1) };
}
else {
p1 = { min(m,l1 + l2), min(m, (x - (x1 - r1))) };
p2 = { min(m,l1 + l2), min(m, (x - (x2 - r2))) };
}
ran[u] = uni(p1, p2);
}
void slv() {
make_node();
make_node();
cin >> s;
n = (int)s.size();
if (s == "?") {
cout << 1;
return;
}
int cur_node = 1;
for (int i = 0; i < n - 1; ++i) {
if (s[i + 1] == '(') {
if (s[i] == 'x') {
type[cur_node] = 1;
}
continue;
}
if (s[i] == '(') {
make_node();
child[cur_node].ff = m + 1;
p[m + 1] = cur_node;
cur_node = ++m;
}
if (s[i] == ',') {
make_node();
cur_node = p[cur_node];
child[cur_node].ss = m + 1;
p[m + 1] = cur_node;
cur_node = ++m;
}
if (s[i] == ')') {
cur_node = p[cur_node];
}
if (s[i] == '?') {
cap[cur_node] = 1;
leaf[cur_node] = 1;
}
}
dfs();
cout << ran[1].ss - ran[1].ff + 1;
}
void cs() {
int tstc = 1;
//cin >> tstc;
while (tstc--) {
slv();
}
}
void precalc() {
return;
}
int main() {
fastio();
precalc();
//precision(0);
cs();
return 0;
}
