# 仕組みはわかったが愚直な計算では間に合わない気がする

N = int(input())
mod = 998244353

# nCrメモ化パッケージ
factorial = [1] #0分
inverse = [1] #0分
for i in range(1, N+1):
    factorial.append(factorial[-1]*i%mod)
    inverse.append(pow(factorial[-1], mod-2, mod))
    
def nCr_fast(N, R, MOD):
    if N < R or R < 0:
        return 0
    elif R == 0 or R == N:
        return 1
    return factorial[N]*inverse[R]*inverse[N-R]%MOD

ans = 0
if N%2 == 1:
    temp = N//2
    for i in range(1, N+1, 2):
        calc = nCr_fast(N, temp, mod)*2
        temp -= 1
        ans += calc*pow(2, i, mod)
        ans %= mod
        #print('i', i, 'calc', calc, calc*pow(2, i, mod))
elif N%2 == 0:
    temp = N//2
    for i in range(0, N+1, 2):
        calc = nCr_fast(N, temp, mod)*2
        temp -= 1
        ans += calc*pow(2, i, mod)
        ans %= mod
        #print('i', i, 'calc', calc, calc*pow(2, i, mod))
print(ans)