#include "bits/stdc++.h"

using namespace std;
#define int long long
char avail[] = {'(', ')', '[', ']', '{', '}', '<', '>', '.', '?'};

bool isMatch(char s, char e) {
    if (s == '(' and e == ')')return 1;
    if (s == '<' and e == '>')return 1;
    if (s == '{' and e == '}')return 1;
    if (s == '[' and e == ']')return 1;
    return 0;
}

string t;
map<pair<int, string>, int> dp;

long long rec(int id, string s) {
    if (s.size() > id + 1)return 0;
    if (id < 0)return s.empty();
    if (dp.find({id, s}) != dp.end())return dp[{id, s}];
    long long &ret = dp[{id, s}];
    if (t[id] == '?') {
        for (int i = 1; i < 8; i += 2) {
            s += avail[i];
            ret += rec(id - 1, s);
            s.pop_back();
        }
        if (s.size() > 0 and (s.back() == ')' or s.back() == ']' or s.back() == '}' or s.back() == '>')) {
            s.pop_back();
            ret += rec(id - 1, s);
        }
    }
    if (t[id] == ')' or t[id] == ']' or t[id] == '}' or t[id] == '>') {
        s.push_back(t[id]);
        ret = rec(id - 1, s);
    } else {
        if (s.size() > 0 and isMatch(t[id], s.back())) {
            s.pop_back();
            ret = rec(id - 1, s);
        }
    }
    return ret;
}

signed main() {

    cin >> t;
    cout << rec((int) t.size() - 1, "") << endl;
}