#pragma region satashun //#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") #include using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using pii = pair; template using V = vector; template using VV = V>; template V make_vec(size_t a) { return V(a); } template auto make_vec(size_t a, Ts... ts) { return V(ts...))>(a, make_vec(ts...)); } #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i, n) rep2(i, 0, n) #define rep2(i, m, n) for (int i = m; i < (n); i++) #define per(i, b) per2(i, 0, b) #define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--) #define ALL(c) (c).begin(), (c).end() #define SZ(x) ((int)(x).size()) constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template void chmin(T& t, const U& u) { if (t > u) t = u; } template void chmax(T& t, const U& u) { if (t < u) t = u; } template void mkuni(vector& v) { sort(ALL(v)); v.erase(unique(ALL(v)), end(v)); } template vector sort_by(const vector& v, bool increasing = true) { vector res(v.size()); iota(res.begin(), res.end(), 0); if (increasing) { stable_sort(res.begin(), res.end(), [&](int i, int j) { return v[i] < v[j]; }); } else { stable_sort(res.begin(), res.end(), [&](int i, int j) { return v[i] > v[j]; }); } return res; } template istream& operator>>(istream& is, pair& p) { is >> p.first >> p.second; return is; } template ostream& operator<<(ostream& os, const pair& p) { os << "(" << p.first << "," << p.second << ")"; return os; } template istream& operator>>(istream& is, vector& v) { for (auto& x : v) { is >> x; } return is; } template ostream& operator<<(ostream& os, const vector& v) { os << "{"; rep(i, v.size()) { if (i) os << ","; os << v[i]; } os << "}"; return os; } #ifdef LOCAL void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif template void scan(vector& v, T offset = T(0)) { for (auto& x : v) { cin >> x; x += offset; } } // suc : 1 = newline, 2 = space template void print(T x, int suc = 1) { cout << x; if (suc == 1) cout << "\n"; else if (suc == 2) cout << " "; } template void print(const vector& v, int suc = 1) { for (int i = 0; i < v.size(); ++i) print(v[i], i == int(v.size()) - 1 ? suc : 2); } template void show(T x) { print(x, 1); } template void show(Head H, Tail... T) { print(H, 2); show(T...); } struct prepare_io { prepare_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); } } prep_io; #pragma endregion satashun // https://cp-algorithms.com/algebra/prime-sieve-linear.html // mimic ksun48 implementation const int X = 1e7; bitset is_prime; vector pr; int mu[X]; // moebius int pf[X]; // pf[i] := smallest prime p s.t. p | i void sieve() { is_prime.flip(); is_prime[0] = is_prime[1] = false; mu[1] = 1; for (int i = 2; i < X; i++) { if (is_prime[i]) { pr.push_back(i); pf[i] = i; mu[i] = -1; } for (int p : pr) { if (ll(i) * p >= X) break; is_prime[i * p] = false; mu[i * p] = -mu[i]; pf[i * p] = p; if (i % p == 0) { mu[i * p] = 0; break; } } } } struct PrimePrepare { PrimePrepare() { sieve(); } } prep_prime; vector factorize(int x) { vector vec; while (pf[x] > 1) { int d = pf[x]; int c = 0; while (x % d == 0) { x /= d; c++; } vec.emplace_back(d, c); } if (x != 1) { vec.emplace_back(x, 1); } return vec; } template struct ModInt { using uint = unsigned int; using ull = unsigned long long; using M = ModInt; uint v; ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); } M& set_norm(uint _v) { //[0, MOD * 2)->[0, MOD) v = (_v < MOD) ? _v : _v - MOD; return *this; } explicit operator bool() const { return v != 0; } explicit operator int() const { return v; } M operator+(const M& a) const { return M().set_norm(v + a.v); } M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); } M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); } M operator/(const M& a) const { return *this * a.inv(); } M& operator+=(const M& a) { return *this = *this + a; } M& operator-=(const M& a) { return *this = *this - a; } M& operator*=(const M& a) { return *this = *this * a; } M& operator/=(const M& a) { return *this = *this / a; } M operator-() const { return M() - *this; } M& operator++(int) { return *this = *this + 1; } M& operator--(int) { return *this = *this - 1; } M pow(ll n) const { if (n < 0) return inv().pow(-n); M x = *this, res = 1; while (n) { if (n & 1) res *= x; x *= x; n >>= 1; } return res; } M inv() const { ll a = v, b = MOD, p = 1, q = 0, t; while (b != 0) { t = a / b; swap(a -= t * b, b); swap(p -= t * q, q); } return M(p); } friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; } friend istream& operator>>(istream& in, M& x) { ll v_; in >> v_; x = M(v_); return in; } bool operator<(const M& r) const { return v < r.v; } bool operator>(const M& r) const { return v < *this; } bool operator<=(const M& r) const { return !(r < *this); } bool operator>=(const M& r) const { return !(*this < r); } bool operator==(const M& a) const { return v == a.v; } bool operator!=(const M& a) const { return v != a.v; } static uint get_mod() { return MOD; } }; // using Mint = ModInt<1000000007>; using Mint = ModInt<998244353>; void slv() { int N; cin >> N; Mint ans = 1; for (int p : pr) { if (p > N) break; int x = N; { ll t = 1; while (x % p == 0) { x /= p; t *= p; } int b = 0; if (x == 1) { t /= p; } t *= t; ans *= t; } if (x != 1 && x % p) { while (x) { x /= p; ans *= p; } ans /= p; } } show(ans); } int main() { int cases = 1; // cin >> cases; rep(i, cases) slv(); return 0; }