mod=998244353
def cmb(n,r):
  if r<0 or r>n:
    return 0
  return ((g1[n]*g2[r]%mod)*g2[n-r])%mod

N=300000
g1=[1]*(N+3)
for i in range(2,N+3):
  g1[i]=g1[i-1]*i%mod
g2=[0]*len(g1)
g2[-1]=pow(g1[-1],mod-2,mod)
for i in range(N+1,-1,-1):
  g2[i]=g2[i+1]*(i+1)%mod
inv=[0]*(N+3)
for i in range(1,N+3):
  inv[i]=g2[i]*g1[i-1]%mod

N=int(input())
P=[0]*(N+1)
P[0]=1
for i in range(N):
  P[i+1]=P[i]*2%mod
ANS=0
for K in range(N+1):
  v=1
  for i in range(K+1):
    ANS=(ANS+(pow(P[K]-i,N,mod)*cmb(K,i)*v%mod)*g2[K])%mod
    v=-v
print(ANS)