n=int(input())
mod=998244353
comb=1

pow2=[1]*(n+1)

def invmod(x):
    return pow(x,mod-2,mod)

for r in range(1,n+1):
    pow2[r]=(pow2[r-1]*2)%mod
ans=0
for r in range(n//2+1):
    ans+=comb*pow2[abs(4*r-n)]
    ans%=mod
    comb*=(n-2*r-1)*(n-2*r)*invmod(2*r+2)*invmod(2*r+1)
    comb%=mod

print((2*ans)%mod)