#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pl pair<ll, ll>
#define pi pair<int, int>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
using namespace std;

#if 1
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '['; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "]";}
void _print() {cerr << endl << flush;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "*["<<__LINE__<<"]\t"<< #x << " = "; _print(x)
#endif

const ll mod = 1e9 + 7;

template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll gcd(ll a, ll b) {if(b == 0){return a;} return gcd(b, a % b);}

char c[8] = {'(', ')', '[', ']', '{', '}', '<', '>'};
map<char, int> id, val;
string s; 
int n;
map<string, ll> memo;

//s[x], c[z]
ll dfs(string s){
	if (memo.count(s)) return memo[s];
	if (s.size() == 0) return 1;
	if (val[s[0]] < 0) return 0;
	ll ans = 0;
	if (s[0] == '?'){
		for (int i = 0; i < 4; i ++){
			for (int j = 1; j < s.size(); j ++){
				if (s[j] == '?' || (id[s[j]] == i && val[s[j]] == -1)) ans += dfs(s.substr(1, j - 1)) * dfs(s.substr(j + 1, n - 1 - j));
			}
		}
	} else{
		for (int j = 1; j < s.size(); j ++){
			if (s[j] == '?' || (id[s[j]] == id[s[0]] && val[s[j]] == -1)) ans += dfs(s.substr(1, j - 1)) * dfs(s.substr(j + 1, n - 1 - j));
		}
	}
	memo[s] = ans;
	return ans;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	id['('] = 0; id[')'] = 0;
	id['['] = 1; id[']'] = 1;
	id['{'] = 2; id['}'] = 2;
	id['<'] = 3; id['>'] = 3;
	val['('] = 1; val[')'] = -1;
	val['['] = 1; val[']'] = -1;
	val['{'] = 1; val['}'] = -1;
	val['<'] = 1; val['>'] = -1;
	cin >> s; n = s.size();
	ll ans = dfs(s);
	cout << ans << '\n';
}

//hard case: ????????????????????