#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 25;
ll f[N + 1];
string decode(int n, ll val) {
	if (!n) return "";
	for (int u = 0; u < n; u++) {
		for (int v = 0; v < n - u; v++) {
			int w = n - u - v - 1;
			if (val < f[u] * f[v] * f[w]) {
				ll vw = val % f[w];
				val /= f[w];
				ll vv = val % f[v];
				val /= f[v];
				ll vu = val;
				assert(val < f[u]);
				return "("s + decode(u, vu) + "|" + decode(v, vv) + ")" + decode(w, vw);
			}
			val -= f[u] * f[v] * f[w];
		}
	}
	assert(false);
}
ll encode(int n, string s) {
	if (!n) return 0;
	int p = -1, q = -1;
	for (int i = 1, cur = 0; i < s.size(); i++) {
		if (s[i] == '(') cur++;
		if (s[i] == ')') cur--;
		if (cur == 0 && s[i] == '|') p = i;
		if (cur == -1 && s[i] == ')') {
			q = i;
			break;
		}
	}
	assert(p != -1 && q != -1);
	int U = p / 3, V = (q - p) / 3;
	ll ans = 0;
	for (int u = 0; u <= U; u++) {
		for (int v = 0; v < n - u; v++) {
			int w = n - 1 - u - v;
			if (u == U && v == V) {
				ll val = encode(u, s.substr(1, p - 1));
				val *= f[v];
				val += encode(v, s.substr(p + 1, q - (p + 1)));
				val *= f[w];
				val += encode(w, s.substr(q + 1, s.size() - (q + 1)));
				ans += val;
				return ans;
			}
			ans += f[u] * f[v] * f[w];
		}
	}
	assert(false);
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	for (int n = f[0] = 1; n <= N; n++) {
		for (int u = 0; u < n; u++) {
			for (int v = 0; v < n - u; v++) {
				f[n] += f[u] * f[v] * f[n - 1 - u];
			}
		}
	}
	string phase;
	cin >> phase;
	int t;
	cin >> t;
	while (t--) {
		int n;
		cin >> n;
		if (phase == "encode") {
			string s;
			cin >> s;
			cout << encode(n, s) << "\n";
		} else {
			ll val;
			cin >> val;
			cout << decode(n, val) << "\n";
		}
	}
	return 0;
}