#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
constexpr int MAX = 200100;
mint fact[MAX], finv[MAX], inv[MAX];
void cominit() {
  int m = mint::mod();
  fact[0] = fact[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  FOR(i, 2, MAX){
    fact[i] = fact[i-1] * i;
    inv[i] = m - inv[m%i] * (m/i);
    finv[i] = finv[i-1] * inv[i];
  }
}
mint ncr(int n, int r) {return fact[n]*finv[r]*finv[n-r];}
int main()
{
  int N;
  cin >> N;
  cominit();
  vector<vector<mint>> a(15, vector<mint>(N-1));
  REP(i, N-1) a[0][i] = ((mint)i+1) * finv[i];
  FOR(k, 1, 15) {
    vector<mint> tmp = convolution(a[k-1], a[k-1]);
    REP(i, N-1) a[k][i] = tmp[i];
  }
  vector<mint> b(N-1);
  b[0] = 1;
  REP(k, 15) if(N>>k&1) {
    vector<mint> tmp = convolution(b, a[k]);
    REP(i, N-1) b[i] = tmp[i];
  }
  mint ans = b[N-2] * fact[N-2] * ((mint)N).pow(N-2).inv();
  cout << ans.val() << endl;

}