#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
#define mod 1000000000000000031
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}

#define lll __int128
ll power(ll p,ll k){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = (lll)ans * p % mod;
		p = (lll)p * p % mod;
		k /= 2;	
	}
	return ans;
}
int n;
ll res[1000005];

int main(){
	res[1000000] = 300;
	per(i,999999,0) res[i] = power(42,res[i + 1]);
	scanf("%d",&n);
	printf("%lld\n",res[n]);
	return 0;
}