import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


def factorial(N,p):  # 0!~N!(mod p) のリスト
    res = [0]*(N+1)
    res[0] = 1
    for i in range(1,N+1):
        res[i] = (res[i-1]*i) % p
    return res


def factorial_inverse(N,p):  # 0!~N!(mod p) の逆元のリスト
    fac = factorial(N,p)
    res = [0]*(N+1)
    a = pow(fac[-1],p-2,p)
    for i in range(N,-1,-1):
        res[i] = a
        a *= i
        a %= p
    return fac,res


N = I()
mod = 998244353

fac,fac_inv = factorial_inverse(N,mod)


def nCr(n,r):
    return (fac[n]*fac_inv[r]*fac_inv[n-r]) % mod


power = [1]
for i in range(1,N+2):
    power.append((power[-1]*2) % mod)

ans = 0
for i in range(N//2+1):
    ans += power[abs(N-4*i)+1]*nCr(N,2*i)
    ans %= mod

print(ans)