#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <math.h>#define mod 29using namespace std;typedef long long ll;ll mpow(ll x,ll k){    ll t=1;    while(k)    {        if(k&1) t=((t%mod)*(x%mod))%mod;        k>>=1;        x=((x%mod)*(x%mod))%mod;    }    return t;}ll X,Y;void extend(ll A,ll B,ll &x1,ll &y1){    if(B==0)    {       x1=1;       y1=0;       return ;    }    extend(B,A%B,x1,y1);     ll t=x1;     x1=y1;     y1=t-(A/B)*y1;}int main(){    int n;    ll a,b,c,sum,temp;    while(scanf("%d",&n)!=EOF&&n!=0)    {        sum=1;        temp=2*n+1;        a=mpow(2,temp);        a=(a-1)%mod;        b=mpow(3,n+1);        b=(b-1)%mod;        b=(b*15)%mod;        c=mpow(167,n+1);        c=(c-1)%mod;        extend(166,29,X,Y);        X=(X%mod+mod)%mod;        c=(c*X)%mod;        sum=((a%mod)*(b%mod)*(c%mod))%mod;        printf("%I64d\n",sum);    }    return 0;}