#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef LOCAL
#include "debug.hpp"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

const ll MAX = 1e6 + 10;
vector<ll> minFactor(MAX, 0);
void calc() {
  for (ll i = 2; i <= MAX; i++) {
    if (minFactor[i]) continue;
    for (ll j = i; j <= MAX; j += i) {
      if (minFactor[j] == 0) minFactor[j] = i;
    }
  }
}

ll MOD = 998244353;
ll pow_mod (ll a, ll x) {
  if (x == 0) return 1;
  if (x == 1) return a;
  ll ans = pow_mod(a, x / 2);
  ans = (ans * ans) % MOD;
  if (x % 2) ans = (ans * a) % MOD;
  return ans;
}

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

  ll N; cin >> N;
  calc();
  vector<ll> d(1e6 + 10, 0);
  for (ll i = 1; i < N; i++) {
    ll a = i, b = N - i;
    while (a * b > 1) {
      ll p;
      if (a == 1) p = minFactor[b];
      else if (b == 1) p = minFactor[a];
      else p = min(minFactor[a], minFactor[b]);

      ll cnt = 0;
      while (a != 1 && minFactor[a] == p) {
        a /= p;
        cnt++;
      }
      while (b != 1 && minFactor[b] == p) {
        b /= p;
        cnt++;
      }
      if (d[p] < cnt) d[p] = cnt;
      // debug(a, b, p, d[p]);
    }
  }
  ll ans = 1;
  for (ll i = 1; i < 1e6 + 5; i++) {
    if (d[i]) {
      ans = (ans * pow_mod(i, d[i])) % MOD;
    }
  }
  cout << ans << '\n';
  return 0;
}