#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1LL)
#define MASK(i) (1LL << (i))
ull dp[60];
ll wow[61];
ll recursion_count = 0;
ll find_right(string s){
    assert(sz(s)>0);
    ll sum = 0;
    ll l = -1;
    for (ll i = sz(s) - 2;i >= 0;i --){
        sum += (s[i] == '|' ? 0 : (s[i] == '(' ? 1 : -1));
        if (sum == 0 && s[i] == '|'){l = i;break;}
    }
    return l;
}
ll normal_to_int(string s);
ll wow_to_int(string s){
    if ((recursion_count++)>1000){
        assert(0);
        return 0;
    }
    ll n=sz(s)/3;
    assert(n!=0);
    if (n < 2)return 0;
    ll l = find_right(s);
    ll right_sz = (sz(s) - 1 - (l + 1) + 1)/3;
    ll res = 0;
    for (ll i = 0;i < right_sz;i ++){
        res += dp[i] * dp[n-1-i];
    }
    string left_part(s,1,l-1),right_part(s,l+1,sz(s)-2-l);
    return res + normal_to_int(left_part) * dp[sz(right_part)] + normal_to_int(right_part);
}
ll normal_to_int(string s){
    if ((recursion_count++)>1000){
        assert(0);
        return 0;
    }
    ll n = sz(s)/3;
    if (n < 2)return 0;
    ll sum = 0;
    ll l = -1;
    for (ll i = sz(s) - 1;i >= 0;i --){
        sum += (s[i] == '|' ? 0 : (s[i] == '(' ? 1 : -1));
        if (sum == 0){l = i;break;}
    }
    ll right_sz = (sz(s)-l)/3;
    if (right_sz==n){
        return wow_to_int(s);
    }
    else{
        ll res = wow[n];
        for (ll i = 1;i < right_sz;i ++){
            res += wow[i] * dp[n-i];
        }
        string left_part(s,0,sz(s)-right_sz*3),right_part(s,sz(s)-right_sz*3,right_sz*3);
//        cout<<s<<' '<<left_part<<' '<<right_part<<endl;
        return res + normal_to_int(left_part) * wow[sz(right_part)/3] + wow_to_int(right_part);
    }
}
ll to_int(string s){
    recursion_count = 0;
    ll res = 0;
    ll n=sz(s)/3;
    for (ll i = 0;i < n;i++)res+=dp[i];
    res += normal_to_int(s);
    return res;
}
string pr_to_string(ll n,ll k){
    if (n == 1)return "(|)";
    if (n==0)return "";
    if (k < wow[n]){
        for (ll j = 0;j < n;j ++){
            if (dp[j] * dp[n-1-j]<=k)k-=dp[j] * dp[n-1-j];
            else{
                ll k1,k2;
                k1 = k / dp[j];
                k2 = k % dp[j];
                return "(" + pr_to_string(n-1-j,k1) + "|" +  pr_to_string(j,k2) + ")";
            }
        }
    }
    else{
        k -= wow[n];
        for (ll i = 1;i < n;i ++){
            if (wow[i] * dp[n-i]<=k)k-=wow[i] * dp[n-i];
            else{
                ll k1,k2;
                k1 = k / wow[i];
                k2 = k % wow[i];
                return pr_to_string(n-i,k1)+pr_to_string(i,k2);
            }
        }
    }

}
string too_string(ll x){
    recursion_count = 0;
    for (ll i = 0;i <= 25;i ++){
        if (x >= ll(dp[i]))x -= dp[i];
        else {return pr_to_string(i,x);}
    }
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
    dp[0] = 1;
    for (ll i = 1;i <= 25;i ++){
        wow[i] = 0;
        for (ll j = 0;j < i;j ++){
            wow[i] += dp[j] * dp[i-1-j];
        }
        dp[i] = wow[i];
        for (ll j = 1;j < i;j ++){
            dp[i] += wow[j] * dp[i-j];
        }
//        cout<<i<<' '<<ld(dp[i])<<' '<<ld(wow[i])<<'\n';
    }
//    for (ll i = 0;i < dp[0] + dp[1] + dp[2] + dp[3] + dp[4] + dp[5];i ++){
//        cout<<i<<' '<<too_string(i)<<' '<<to_int(too_string(i))<<endl;
//    }
//    cout<<normal_to_int("(|)(|)")<<endl;
    string task;
    cin>>task;
    ll t;
    cin>>t;
    while (t--){
        ll n;
        cin>>n;
        if (task=="encode"){
            string s;
            cin>>s;
            cout<<to_int(s)<<'\n';
//            cout<<ld(to_int(s))<<'\n';
//            if (recursion_count > 1000){
//                cout<<s<<'\n';
//            }
//            cout<<pr_to_int(s)<<'\n';
        }
        else{
            ll x;
            cin>>x;
            cout<<too_string(x)<<'\n';
        }
    }
}
/*
encode
1
4
(|(|)(|)(|))
decode
3
1
1
4
17
5
302

1274049
1273964
*/