#include <bits/stdc++.h>

#define eb emplace_back
#define ulll unsigned __int128

using namespace std;

const int N = 140 + 5;

vector<int> G[N]; 
ulll t, g, ca[N];
int pp[N];

int tot = 0;
void DFS1(int u) {
	if(u != 1) pp[++ tot] = 1;
	for(int v : G[u]) DFS1(v);
	if(u != 1) pp[++ tot] = 0;
}

void Write1(ulll x) {
	if(x >= 10) Write1(x / 10);
	cerr << (char)(x % 10 + '0');
}

ulll Get(int l, int r) {
	if(l + 1 == r) return 1;
	if(l > r) return 1;
	int cnt = 1, k;
	for(int i = l + 1; i <= r; ++ i) {
		cnt += pp[i] == 1 ? 1 : -1;
		if(cnt == 0) {
			k = i;
			break;
		}
	}
	ulll t = 0;
	for(int j = 1; j < (k - l + 1) / 2; ++ j) t += (ulll)ca[j - 1] * ca[(r - l + 1) / 2 - j];
	ulll t1 = Get(l + 1, k - 1), t2 = Get(k + 1, r);
//	Write1(t + (t1 - 1) * ca[(r - k) / 2] + t2), cerr << "\n" << endl;
	return t + (t1 - 1) * ca[(r - k) / 2] + t2;
}

ulll encoder(int n, const int *p) {
	ca[0] = 1, ca[1] = 1, ca[2] = 2;
	for(int i = 3; i < n; ++ i) {
		if(ca[i - 1] % (i + 1) == 0) ca[i] = ca[i - 1] / (ulll)(i + 1) * (ulll)(4 * i - 2);
		else ca[i] = ca[i - 1] * (ulll)(4 * i - 2) / (ulll)(i + 1);
//		Write1(ca[i]), cerr << endl;
	}
//	Write1(ca[70]), cerr << endl;
	for(int i = 1; i <= n; ++ i) G[i].clear();
	for(int i = 2; i <= n; ++ i) G[p[i]].eb(i);
	for(int i = 1; i <= n; ++ i) sort(G[i].begin(), G[i].end());
	tot = 0, DFS1(1);
	return Get(1, tot);
}

int st[N], tp;
int gh[N];

void Solve(int l, int r, ulll x) {
	if(l == r - 1) {
		gh[l] = 1, gh[r] = 0;
		return ;
	}
	if(l > r) return ;
	for(int j = 1; j <= (r - l + 1) / 2; ++ j) {
		if(x > ca[j - 1] * ca[(r - l + 1) / 2 - j]) x -= ca[j - 1] * ca[(r - l + 1) / 2 - j];
		else {
			gh[l] = 1, gh[l + 2 * j - 1] = 0;
			ulll t1, t2;
			if(x % ca[(r - l + 1) / 2 - j] == 0) t2 = ca[(r - l + 1) / 2 - j], t1 = x / ca[(r - l + 1) / 2 - j];
			else t2 = x % ca[(r - l + 1) / 2 - j], t1 = x / ca[(r - l + 1) / 2 - j] + 1;
			Solve(l + 1, l + 2 * j - 2, t1);
			Solve(l + 2 * j, r, t2);
			return ;
		}
	}
}

void Write(ulll x) {
	if(x >= 10) Write(x / 10);
	cerr << (char)(x % 10 + '0');
}

void decoder(int n, unsigned __int128 M, int *p) {
	ca[0] = 1, ca[1] = 1, ca[2] = 2;
	for(int i = 3; i < n; ++ i) {
		if(ca[i - 1] % (i + 1) == 0) ca[i] = ca[i - 1] / (ulll)(i + 1) * (ulll)(4 * i - 2);
		else ca[i] = ca[i - 1] * (ulll)(4 * i - 2) / (ulll)(i + 1);
	}
	for(int i = 1; i <= 2 * n - 2; ++ i) gh[i] = 0;
	Solve(1, 2 * n - 2, M);
	st[++ tp] = 1;
	for(int i = 1, j = 2; i <= 2 * (n - 1); ++ i) {
		if(gh[i]) p[j] = st[tp], st[++ tp] = j ++;
		else tp --;
	}
	tp = 0;
	return ;
}