#include #include #include #include #include #include #include #define rep(i, a, b) for (int i = int(a); i < int(b); i++) using namespace std; using ll = long long int; using P = pair; // clang-format off #ifdef _DEBUG_ #define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false) template void PPPPP(T t) { cerr << t; } template void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); } #else #define dump(...) do{ } while(false) #endif template vector make_v(size_t a, T b) { return vector(a, b); } template auto make_v(size_t a, Ts... ts) { return vector(a, make_v(ts...)); } template bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; } template bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; } template void print(T a) { cout << a << '\n'; } template void print(T a, Ts... ts) { cout << a << ' '; print(ts...); } template istream &operator,(istream &in, T &t) { return in >> t; } // clang-format on template class ModInt { ll n; ModInt constexpr inverse() const { return ModInt::pow(*this, MOD - 2); } public: ModInt() : n(0) {} ModInt(ll _n) : n(((_n % MOD) + MOD) % MOD) {} ModInt operator+=(const ModInt &m) { n += m.n; if (n >= MOD) n -= MOD; return *this; } ModInt operator-=(const ModInt &m) { n -= m.n; if (n < 0) n += MOD; return *this; } ModInt operator*=(const ModInt &m) { n *= m.n; if (n >= MOD) n %= MOD; return *this; } ModInt operator/=(const ModInt &m) { (*this) *= m.inverse(); return *this; } friend ModInt operator+(ModInt t, const ModInt &m) { return t += m; } friend ModInt operator-(ModInt t, const ModInt &m) { return t -= m; } friend ModInt operator*(ModInt t, const ModInt &m) { return t *= m; } friend ModInt operator/(ModInt t, const ModInt &m) { return t /= m; } ModInt operator=(const ll l) { n = l % MOD; if (n < 0) n += MOD; return *this; } friend ostream &operator<<(ostream &out, const ModInt &m) { out << m.n; return out; } friend istream &operator>>(istream &in, ModInt &m) { ll l; in >> l; m = l; return in; } static constexpr ModInt pow(const ModInt x, ll p) { ModInt ans = 1; for (ModInt m = x; p > 0; p /= 2, m *= m) { if (p % 2) ans *= m; } return ans; } }; using mint = ModInt<998244353>; mint operator"" _m(unsigned long long m) { return mint(m); } class Eratosthenes { vector plist; public: Eratosthenes(int sz) : plist(sz, -1) { for (int i = 2; i < sz; i++) { if (plist[i] == -1) { for (int j = i; j < sz; j += i) { if (plist[j] == -1) { plist[j] = i; } } } } } bool isPrime(int n) { return plist[n] == n; } vector factor(int n) { vector res; while (n > 1) { res.push_back(plist[n]); n /= plist[n]; } return res; } }; #include int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int n; cin, n; Eratosthenes era(n + 1); vector> lst(n); map mx1, mx2; mint ans = 1; vector> v1(n), v2(n); rep(i, 1, n + 1) { auto res = era.factor(i); for (auto e : res) { lst[i - 1][e]++; } for (auto [e, c] : lst[i - 1]) { v1[i - 1][e] = mx1[e]; mx1[e] = max(mx1[e], c); } } for (auto [n, c] : mx1) { rep(i, 0, c) { ans *= n; } } for (int i = n; i >= 1; i--) { for (auto [e, c] : lst[i - 1]) { v2[i - 1][e] = mx2[e]; mx2[e] = max(mx2[e], c); } } ll m = 1; rep(i, 1, n + 1) { ll t = 1; for (auto [e, c] : lst[i - 1]) { ll cc = max(v1[i - 1][e], v2[i - 1][e]); rep(j, cc, c) { t *= e; } } // dump(i, t); chmax(m, t); } print(ans / m); return 0; }