#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
const int MX = 105;
const int mod = 175781251;
ll dp[MX][MX],c[MX][MX],sum[MX],res[MX],p3[MX];
void init()
{
int n = 100;
p3[0] = 1;
for(int i = 1; i <= n; i++) p3[i] = p3[i-1]*3%mod;
c[0][0] = 1;
for(int i = 1; i <= n; i++){
c[i][0] = c[i][i] = 1;
for(int j = 1; j < i; j++)
c[i][j] = (c[i-1][j] + c[i-1][j-1])%mod;
}
//sum数组记录的是i个点构成一个联通块的计数
//dp[i][j]表示分为i,j两堆,其中编号i这个点一定会在j那一堆中。
dp[0][0] = 1;
sum[0] = 1;
sum[1] = 1;
dp[1][1] = 1;
for(int i = 2; i <= n; i++){
for(int j = 1; j <= i; j++){
for(int x = 1; x < i-1; x++){
//i这个点必须向x-k个点中(不连边,连一条白色的边,连一条黑色的边),但是至少要连一条边
for(int k = 1; k < x && k < j; k++){
dp[i][j] += 2*c[i-2][x-1]*(p3[x-k]-1)%mod*dp[x][k]%mod*dp[i-x][j-k]%mod;
}
for(int k = j-1; k > 0 && i-x > j-k; k--){
dp[i][j] += c[i-2][x-1]*(p3[k]-1)%mod*dp[x][k]%mod*dp[i-x][i-x-(j-k)]%mod;
}
dp[i][j] = (dp[i][j] + mod)%mod;
}
dp[i][j] += dp[i-1][j-1]*(p3[i-j]-1)%mod;
dp[i][j] += dp[i-1][j]*(p3[j]-1)%mod;
dp[i][j] = (dp[i][j] + mod)%mod;
sum[i] += dp[i][j];
sum[i] %= mod;
}
}
//答案中也要统计有多个联通块的情况
res[0] = 1;
for(int i = 1; i <= n; i++){
//编号为i的点一定在res[i-j]的这堆联通块中,而不能在sum那边
for(int j = 1; j <= i; j++)
res[i] += c[i-1][j-1]*res[i-j]%mod*sum[j]%mod;
res[i] %= mod;
}
}
int main()
{
#ifdef LOCAL
freopen("input.txt","r",stdin);
#else
freopen("bipartite.in","r",stdin);
freopen("bipartite.out","w",stdout);
#endif // LOCAL
init();
int n;
while(~scanf("%d",&n) && n){
cout<<res[n]<<endl;
}
return 0;
}