#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <stack>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    string a;
    cin >> a;
    stack<char> s1;
    stack<char> s2;
    int sum = 0;
    int cur = 1;
    int flag = 0;
    for (int j = 0; j < a.size(); j++) {
        if (a[j] == ')') {
            if (s1.empty()) {
                flag = 1;
                break;
            }
            cur /= 2;
            s1.pop();
        }
        else if (a[j] == ']') {
            if (s2.empty()) {
                flag = 1;
                break;
            }
            s2.pop();
            cur /= 3;
        }
        else if(a[j]=='('){
            if (j < a.size() - 1 && a[j + 1] == ')') {
                sum += cur * 2;
                j++;
            }
            else {
                cur *= 2;
                s1.push(a[j]);
            }
        }
        else if(a[j]=='['){
            if (j < a.size() - 1 && a[j + 1] == ']') {
                sum += cur * 3;
                j++;
            }
            else {
                cur *= 3;
                s2.push(a[j]);
            }
        }
    }
    if (flag || !s1.empty() || !s2.empty()) {
        cout << 0;
    }
    else {
        cout << sum;
    }

    
    return 0;
}