MOD = 998244353
N = int(input())
A = [1]*(N+1)
for i in range(2,N+1):
    A[i] = (A[i-1]*i)%MOD
B = [1]*(N+1)
B[N] = pow(A[N],MOD-2,MOD)
for i in range(N-1,1,-1):
    B[i] = (B[i+1]*(i+1))%MOD
def comb(n,k):
    if k<0 or k>n:
        return 0
    if k==0 or k==n:
        return 1
    return (A[n]*B[k]*B[n-k])%MOD
ans = 0
for k in range(N//2+1):
    ans = (ans+2*comb(N,2*k)*pow(2,abs(N-4*k),MOD))%MOD
print(ans)