#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

const long long MOD = 998244353;

long long f[200000+1];
long long g[200000+1];

long long modpow(long long x, long long p, long long mod) {
  long long ret = 1;
  while (p) {
    if (p & 1)
      ret = ret * x % mod;
    x = x * x % mod;
    p >>= 1;
  }
  return ret;
}

long long comb(long long n, long long k) {
  return f[n] * g[n-k] % MOD * g[k] % MOD;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  f[0] = g[0] = 1;
  for (int i = 1; i <= 200000; i++) {
    f[i] = i * f[i-1] % MOD;
    g[i] = modpow(f[i], MOD-2, MOD);
  }
  
  int n;
  cin >> n;

  vector<long long> t(n+1);
  t[0] = 1;
  for (int i = 1; i <= n; i++)
    t[i] = 2 * t[i-1] % MOD;

  long long ret = 0;
  for (int i = 0; i <= n; i += 2) {
    int e = n - 2 * i;
    long long pat = 2 * comb(n, i) % MOD;
    ret += pat * t[abs(e)] % MOD;
    ret %= MOD;
  }
  cout << ret << endl;
  
  return 0;
}