import sys
from collections import Counter
input = sys.stdin.readline
N = int(input())
mod = 998244353
res = 0

class Factorial:
  def __init__(self, n, mod):
    self.mod = mod
    self.f = [1]
    for i in range(1, n + 1):
      self.f.append(self.f[-1] * i % mod)
    self.i = [pow(self.f[-1], mod - 2, mod)]
    for i in range(1, n + 1)[: : -1]:
      self.i.append(self.i[-1] * i % mod)
    self.i.reverse()
  def factorial(self, i): return self.f[i]
  def ifactorial(self, i): return self.i[i]
  def combi(self, n, k): return self.f[n] * self.i[n - k] % self.mod * self.i[k] % self.mod
  def permi(self, n, k): return self.f[n] * self.i[n - k] % self.mod

f = Factorial(N, mod)
if N % 2:
  for i in range(N + 1):
    res += f.combi(N, i) * pow(2, abs(N - 2 * i), mod)
    res %= mod
else:
  for i in range(N + 1):
    if i % 2:
      pw = pow(N, mod - 2, mod)
      l = f.combi(N, i) * pw * (N - i) % mod
      r = f.combi(N, i) * pw * i % mod
      res += pow(2, abs(N - 2 * i - 2), mod) * l + pow(2, abs(N - 2 * i + 2), mod) * r
    else: res += f.combi(N, i) * pow(2, abs(N - 2 * i), mod)
    res %= mod

print(res)