#include <bits/stdc++.h>
#include <atcoder/convolution>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const long long INF = 1e18;
const ll mod = 998244353;

using mint = atcoder::modint998244353;
ll N;
mint Factorial[105000];
vector<mint> mul(vector<mint> a, vector<mint> b) {
    vector<mint> ret = atcoder::convolution(a, b);
    ret.resize(N - 1);
    return ret;
}
vector<mint> power(vector<mint> v, ll x) {
    vector<mint> ret;
    ret.push_back(1);
    vector<mint> factor = v;
    ll idx = 0;
    while(x) {
        if(x & (1LL << idx)) {
            ret = mul(ret, factor);
            x -= (1LL << idx);
        }
        factor = mul(factor, factor);
        idx++;
    }
    return ret;
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    Factorial[0] = 1;
    cin >> N;
    for(ll i = 1; i <= N; i++) {
        Factorial[i] = Factorial[i-1] * i;
        //cerr << i << " " << Factorial[i].val() << endl;
    }
    vector<mint> v;
    for(int i = 0; i <= N - 2; i++) {
        v.push_back((i + 1) / Factorial[i]);
    }
    auto u = power(v, N);
    mint ans = u[N-2];
    ans *= Factorial[N-2];
    mint factor = 1;
    for(int i = 0; i < N - 2; i++) factor *= N;
    ans /= factor;
    cout << ans.val() << endl;
    return 0;
}