#define rep(i, l, r) for (auto i = (l); i < (r); i++)
#define chmin(dest, src) if ((dest) > (src)) dest = (src)
#define chmax(dest, src) if ((dest) < (src)) dest = (src)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 998244353;

vector<int> prime_division(int n) {
  vector<int> pd;
  int i = 2;
  while (i * i <= n) {
    while (i % n == 0) {
      pd.push_back(i);
      n /= i;
    }
    i++;
  }
  if (n > 1) pd.push_back(n);
  return pd;
}

int main() {
  int N; cin >> N;

  vector<vector<int>> pds(N);
  rep (i, 1, N) {
    pds[i] = prime_division(i);
  }

  map<int, int> lcm_pd;
  rep (i, 1, N) {
    int j = N - i;
    map<int, int> pd;
    for (int p : pds[i]) pd[p]++;
    for (int p : pds[j]) pd[p]++;
    for (auto &e : pd) {
      chmax(lcm_pd[e.first], e.second);
    }
  }

  ll ans = 1;
  for (auto &e : lcm_pd) {
    rep (i, 0, e.second) {
      ans *= e.first;
      ans %= MOD;
    }
  }

  if (ans < 0) ans += MOD;

  cout << ans << endl;

  return 0;
}