#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000;
struct segment_tree{
  int N;
  vector<int> ST;
  segment_tree(vector<int> A){
    int N2 = A.size();
    N = 1;
    while (N < N2){
      N *= 2;
    }
    ST = vector<int>(N * 2 - 1, INF);
    for (int i = 0; i < N2; i++){
      ST[N - 1 + i] = A[i];
    }
    for (int i = N - 2; i >= 0; i--){
      ST[i] = min(ST[i * 2 + 1], ST[i * 2 + 2]);
    }
  }
  int range_min(int L, int R, int i, int l, int r){
    if (r <= L || R <= l){
      return INF;
    } else if (L <= l && r <= R){
      return ST[i];
    } else {
      int m = (l + r) / 2;
      return min(range_min(L, R, i * 2 + 1, l, m), range_min(L, R, i * 2 + 2, m, r));
    }
  }
  int range_min(int L, int R){
    return range_min(L, R, 0, 0, N);
  }
};
int main(){
  string H;
  cin >> H;
  int N = H.size();
  auto get_finite = [&](int n){
    string ans;
    for (int i = 0; i < n; i++){
      ans += "()";
    }
    return ans;
  };
  if (H == get_finite(N / 2)){
    if (N / 2 % 2 == 0){
      cout << 1 << endl;
    } else {
      cout << 0 << endl;
    }
  } else {
    vector<int> S(N + 1);
    S[0] = 0;
    for (int i = 0; i < N; i++){
      S[i + 1] = S[i];
      if (H[i] == '('){
        S[i + 1]++;
      }
      if (H[i] == ')'){
        S[i + 1]--;
      }
    }
    segment_tree ST(S);
    auto dfs = [&](auto dfs, int L, int R) -> int {
      if (L == R){
        return 1;
      }
      if (H.substr(R - 2, 2) == "()"){
        return dfs(dfs, L, R - 2) ^ 1;
      }
      if (ST.range_min(L + 1, R) == S[L]){
        for (int i = L + 1; i < R; i++){
          if (S[i] == S[L]){
            return dfs(dfs, i, R);
          }
        }
      }
      return dfs(dfs, L + 1, R - 1);
    };
    cout << dfs(dfs, 0, N) << endl;
  }
}