#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int N = 5e3 + 9;
constexpr int P = 998244353;
int n;

IL constexpr int qpow (int b, int k = P - 2) {
  int r = 1;
  for (; k; k >>= 1, b = (LL)b * b % P) if (k & 1) r = (LL)r * b % P;
  return r;
}

int fc[N], ifc[N];

void init (int Z) {
  fc[0] = 1;
  L (i, 1, Z) {
    fc[i] = (LL)fc[i - 1] * i % P;
  }
  ifc[Z] = qpow(fc[Z]);
  R (i, Z - 1, 0) {
    ifc[i] = (LL)ifc[i + 1] * (i + 1) % P;
  }
}

int C (int n, int m) {
  return (LL)fc[n] * ifc[m] % P * ifc[n - m] % P;
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n;
  init(n);
  int ns = 1;
  L (i, 1, n - 1) {
    int all = C(n, i), k = 0;
    if (i == 1) {
      if (n <= 3) {
        k = all;
      } else {
        k = 0;
      }
    } else {
      L (x, 0, 2) {
        L (y, 0, 2) {
          if (x + y < 3 && x + y <= n - i) {
            L (t, 0, min(i - 1, (n - i - x - y) / 3)) {
              k = (k + (t & 1 ? -1LL : 1LL) * C(i - 1, t) * C(n - x - y - 2 - 3 * t, i - 2)) % P;
            }
          }
        }
      }
    }
    ns = (ns + (LL)(all - k) * qpow(all)) % P;
  }
  if (ns < 0) {
    ns += P;
  }
  cout << ns << '\n';
}
// I love WHQ!