#include<bits/stdc++.h>
using namespace std;
#define il inline
#define ll long long
#define gc getchar()
#define rl register ll
#define rc register char
#define rb register bool
#define rp(i,x,y) for(rl i=x;i<=y;++i)
#define my(i,x,y) for(rl i=x;i>=y;--i)
const ll N=1000000+10,mod=998244353;
ll n,c[N],as;
il ll read()
{
rc ch=gc;rl x=0;rb y=1;
while(ch!='-' && (ch>'9' || ch<'0'))ch=gc;
if(ch=='-')ch=gc,y=0;
while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^'0'),ch=gc;
return y?x:-x;
}
il ll power(rl x,rl y){rl as=1;while(y){if(y&1)as=1ll*(as*x)%mod;x=1ll*(x*x)%mod;y>>=1;}return as;}
il void pre(){c[0]=1;rp(i,1,n)c[i]=c[i-1]*(n-i+1)%mod*power(i,mod-2)%mod;}
int main()
{
freopen("cf997c.out","w",stdout);
n=read();if(n==1)return printf("3\n"),0;pre();
rp(i,1,n)as=(as+c[i]*(i&1?1:mod-1)%mod*power(3,i+n*n-n*i)%mod)%mod;as=(as<<1)%mod;
rp(i,1,n){rl powwer=power(3,n-i);as=(as+3*c[i]%mod*(i&1?1:mod-1)%mod*(power(powwer-1,n)-power(powwer,n)+mod)%mod)%mod;}
printf("%lld\n",as);
return 0;
}

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
#define MOD 998244353
#define MAX 1000100
int fpow(int a,int b){int s=1;while(b){if(b&1)s=1ll*s*a%MOD;a=1ll*a*a%MOD;b>>=1;}return s;}
int n;
int jc[MAX],jv[MAX],inv[MAX];
int C(int n,int m){return 1ll*jc[n]*jv[m]%MOD*jv[n-m]%MOD;}
int p[MAX];
int main()
{
freopen("A.in","r",stdin);
freopen("A.out","w",stdout);
cin>>n;if(n==1){puts("3");return 0;}
jc[0]=jv[0]=inv[0]=inv[1]=1;
for(int i=2;i<=n;++i)inv[i]=1ll*inv[MOD%i]*(MOD-MOD/i)%MOD;
for(int i=1;i<=n;++i)jc[i]=1ll*jc[i-1]*i%MOD;
for(int i=1;i<=n;++i)jv[i]=1ll*jv[i-1]*inv[i]%MOD;
p[0]=fpow(fpow(3,n)-3,n)%MOD;
for(int j=1;j<=n;++j)
{
int s=1ll*(fpow(3,j)-3)*fpow(fpow(3,n-j),n)%MOD;
int QwQ=fpow(fpow(3,n-j)-1,n);
s=(s+3ll*QwQ)%MOD;
p[j]=1ll*C(n,j)*s%MOD;
}
int ans=p[0];
for(int i=1,d=MOD-1;i<=n;++i,d=MOD-d)ans=(ans+1ll*d*p[i])%MOD;
ans=(fpow(fpow(3,n),n)+MOD-ans)%MOD;
printf("%d\n",ans);
return 0;
}