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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	string s;
	cin >> s;
	int n = SZ(s) / 2;
	LL ans = 0;
	FOR(mask, 0, 1 << (2 * n))
	{
		if (__builtin_popcount(mask) != n)
			continue;
		stack<int> st;
		bool ok = true;
		LL cur = 1;
		FOR(i, 0, 2 * n)
		{
			if ((mask >> i) & 1)
			{
				st.push(i);
			}
			else
			{
				if (st.empty())
				{
					ok = false;
					break;
				}
				int j = st.top();
				st.pop();
				int tj, ti;
				if (s[j] == '(')
					tj = 0;
				else if (s[j] == '[')
					tj = 1;
				else if (s[j] == '{')
					tj = 2;
				else if (s[j] == '<')
					tj = 3;
				else if (s[j] == '?')
					tj = 4;
				else
					tj = -1;
				if (s[i] == ')')
					ti = 0;
				else if (s[i] == ']')
					ti = 1;
				else if (s[i] == '}')
					ti = 2;
				else if (s[i] == '>')
					ti = 3;
				else if (s[i] == '?')
					ti = 4;
				else
					ti = -1;
				ok &= tj != -1 && ti != -1 && (tj == ti || tj == 4 || ti == 4);
				if (tj == 4 && ti == 4)
					cur *= 4;
			}
			if (!ok)
				break;
		}
		if (!ok)
			continue;
		ans += cur;
	}
	cout << ans << "\n";
	return 0;
}