#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}
const i64 mod = 998244353;

vector<int> sieve(int n){
    vector<int> res(n + 1);
    iota(all(res), 0);
    rep(i, 2, n){
        if (res[i] > 1){
            for (int j = i + i; j <= n; j += i){
                if (res[j] == j) res[j] = res[i];
            }
        }
    }
    return res;
}

auto f = sieve(1000010);

int main()
{
    int n;
    cin >> n;
    map<int, int> ans;
    rep(i, 1, (n + 3) / 2){
        unordered_map<int, int> mp;
        auto a = i, b = n - i;
        while (a > 1){
            mp[f[a]]++;
            a /= f[a];
        }
        while (b > 1){
            mp[f[b]]++;
            b /= f[b];
        }
        for (auto& [k, j]: mp) chmax(ans[k], j);
    }
    i64 t = 1;
    for (auto [i, j]: ans) t *= pow_mod(i, j, mod), t %= mod;
    cout << t << endl;
}