#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=22;
int n;
ll f[N][N];
char a[N],str[10]="[]<>{}()";
int main(){
	scanf("%s",a+1),n=strlen(a+1);
	for(int i=1;i<=n+1;i++)f[i][i-1]=1;
	for(int l=n;l>=1;l--){
		for(int r=l;r<=n;r++){
			if((r-l+1)%2)continue;
			for(int i=0;i<8;i+=2){
				if(a[l]!=str[i]&&a[l]!='?')continue;
				for(int j=l+1;j<=r;j++){
					if(a[j]!=str[i+1]&&a[j]!='?')continue;
					f[l][r]+=f[l+1][j-1]*f[j+1][r];
				}
			}
		}
	}
	cout<<f[1][n]<<endl;
	return 0;
}