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

constexpr long long mod = 998244353;

struct mint {
    long long x;
    mint(long long xx = 0) : x((xx % mod + mod) % mod) {}
    mint& operator+=(mint r) {
        x += r.x;
        if (x >= mod) x -= mod;
        return *this;
    }
    mint& operator-=(mint r) {
        if (x < r.x) x += mod;
        x %= mod;
        return *this;
    }
    mint& operator*=(mint r) {
        x *= r.x;
        x %= mod;
        return *this;
    }
    mint& operator/=(mint r) {
        x *= r.inv().x;
        x %= mod;
        return *this;
    };
    mint pow(long long n) {
        assert(0 <= n);
        mint a = *this, r = 1;
        while (n) {
            if (n & 1) r *= a;
            a *= a;
            n >>= 1;
        }
        return r;
    }
    mint inv() { return pow(mod - 2); }

    friend mint operator+(mint l, mint r) { return mint(l) += r; }
    friend mint operator-(mint l, mint r) { return mint(l) -= r; }
    friend mint operator*(mint l, mint r) { return mint(l) *= r; }
    friend mint operator/(mint l, mint r) { return mint(l) /= r; }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;

    mint ans = 0;
    vector<mint> invs(n + 1);
    invs[0] = mint(0);
    invs[1] = mint(1);
    for (int i = 2; i <= n; i++) invs[i] = -1 * invs[mod % i] * (mod / i);
    mint fac = 1, finv = 1;
    for (int i = 1; i < n; i++) {
        fac *= i;
        finv *= invs[i];
    }
    for (int i = 1; n - 2 * i + 1 >= 0 and i <= n; i++) {
        ans += fac * fac * finv;
        fac *= invs[n - i];
        finv *= n - 2 * i + 1;
        finv *= n - 2 * i;
    }

    cout << ans.x << '\n';
}