import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

struct ModInt(int M_) {
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  string toString() const { return x.to!string; }
}

enum MO = 998244353;
alias Mint = ModInt!MO;

enum LIM = 10^^7 + 10;
Mint[] inv, fac, invFac;
void prepare() {
  inv = new Mint[LIM];
  fac = new Mint[LIM];
  invFac = new Mint[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = -(Mint.M / i) * inv[cast(size_t)(Mint.M % i)];
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(long n, long k) {
  if (0 <= k && k <= n) {
    assert(n < LIM);
    return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];
  } else {
    return Mint(0);
  }
}



void main() {
  prepare();
  
  try {
    for (; ; ) {
      const N = readInt();
      
      debug {
        bool checkDP(string s) {
          auto dp = new bool[][](N + 1, N + 1);
          foreach (i; 0 .. N + 1) {
            dp[i][i] = true;
          }
          foreach (w; 1 .. N + 1) {
            foreach (i; 0 .. N - w + 1) {
              const j = i + w;
              if (!((s[i] == 'A' && s[j - 1] == 'B') || (s[i] == 'B' && s[j - 1] == 'A'))) {
                if (dp[i + 1][j - 1]) {
                  dp[i][j] = true;
                }
              }
              foreach (k; i + 1 .. j) {
                if (dp[i][k] && dp[k][j]) {
                  dp[i][j] = true;
                }
              }
            }
          }
          return dp[0][N];
        }
        bool checkGreedy(string s) {
          int a, b, c;
          foreach (i; 0 .. N) {
            switch (s[i]) {
              case 'A': (i % 2 == 0) ? ++a : ++b; break;
              case 'B': (i % 2 == 0) ? ++b : ++a; break;
              case 'C': ++c; break;
              default: assert(false);
            }
          }
          return (a <= N / 2 && b <= N / 2);
        }
        
        if (N <= 10) {
          int cnt;
          auto cnts = new int[N + 1];
          foreach (p; 0 .. 3^^N) {
            string s;
            foreach (i; 0 .. N) {
              s ~= "ABC"[p / 3^^i % 3];
            }
            const resDP = checkDP(s);
            const resGreedy = checkGreedy(s);
            if (resDP) {
              ++cnt;
              ++cnts[s.count('C')];
            }
            if (resDP != resGreedy) {
              writeln(s, ": ", resDP, " ", resGreedy);
              assert(false);
            }
          }
          writeln("cnt = ", cnt, ", cnts = ", cnts);
        }
      }
      
      Mint ans = Mint(3)^^N;
      foreach (a; N / 2 + 1 .. N + 1) {
        ans -= 2 * binom(N, a) * Mint(2)^^(N - a);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}


Measured memory_bytes: 121852