Happy 2004 hdu1452

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int ans=0;
const int mod=29;
ll quick_mod(ll k,ll n)
{
    ll res=1;
    while(n>0)
    {
        if(n&1)
        {
            res=(res*k)%mod;
        }
        k=k*k%mod;
        n>>=1;
    }
    res--;
    if(res<0) res+=29;
    return res;
}
int main()
{
    ll n;
    while(~scanf("%lld",&n)&&n)
    {
        ans=quick_mod(2,2*n+1)*quick_mod(3,n+1)*quick_mod(22,n+1)*9%mod;
        printf("%d\n",ans);
    }
    return 0;
}