#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define repo(i, b) for (int i = 0; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

bool isOpen(char c) { return c == '(' || c == '{' || c == '<' || c == '['; }
char other(char c) { return c == '(' ? (char)')' : (c + 2); }

ll solve() {
  string s;
  cin >> s;
  ll ans = 0;
  int q = [&]() -> int {
    int cnt = 0;
    for (char& c : s) {
      if (c == '?') cnt++;
    }
    return cnt;
  }();
  ll big = 1 << q;
  // for every combination of open/close for '?'
  rep(i, 0, big) {
    bitset<20> bs(i);
    int ind = 0;
    ans += [&]() -> ll {
      ll res = 1;
      stack<char> st;
      for (char c : s) {
        if (isOpen(c)) {
          st.push(c);
        } else if (c != '?') {
          if (st.empty()) {
            return 0;
          }
          if (c == other(st.top()) || st.top() == '?') {
            st.pop();
          } else {
            return 0;
          }
        } else {
          if (bs.test(ind++)) {
            if (st.empty()) {
              return 0;
            }
            if (st.top() == '?') {
              res *= 4;
            }
            st.pop();
          } else {
            st.push('?');
          }
        }
      }
      if (st.empty()) {
        return res;
      } else
        return 0;
    }();
  }
  return ans;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  cout << solve();
  return 0;
}