using System; using System.Linq; using System.Numerics; using System.Collections; using System.Collections.Generic; using System.IO; using System.Text; using N = System.Int64; static class Program { static public void Main(string[] args) { Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); var solver = new Solver(); solver.Solve(); Console.Out.Flush(); } } public class Solver { public void Solve() { int n = ri; if (n == 2) { Write(1); return; } else if (n == 3) { Write(2); return; } else if (n == 4) { Write(12); return; } ModInt ans = 1; var isprime = new bool[n]; for (int i = 2; i < n; i++) isprime[i] = true; int p = 2; for (; p * p < n; p++) { if (!isprime[p]) continue; for (int j = p * 2; j < n; j += p) isprime[j] = false; int k = 0; int pow = 1; if (n % p == 0) { while (pow * p <= n) { k++; pow *= p; } if (pow == n) k = 2 * k - 2; else { k = 0; pow = 1; while (n % (p * pow) == 0) { k += 2; pow *= p; } int pow2 = pow; while (pow + pow2 * p <= n) { k++; pow2 *= p; } } } else { while (pow * p < n) { k++; pow *= p; } } ans *= ModInt.Pow(p, k); } for (; p < n; p++) { if (!isprime[p]) continue; if (n % p == 0 && p * 2 <= n) ans *= p * p; else ans *= p; } Write(ans); } struct ModInt { private const long _mod = 998244353; long Val; public ModInt(long v) { Val = v; } public override string ToString() { return Val.ToString(); } public static implicit operator ModInt(long n) { long r = n % _mod; return new ModInt(r < 0 ? r + _mod : r); } public static ModInt operator +(ModInt a, ModInt b) { long r = a.Val + b.Val; return new ModInt(r < _mod ? r : r - _mod); } public static ModInt operator -(ModInt a, ModInt b) { long r = a.Val - b.Val; return new ModInt(r < 0 ? r + _mod : r); } public static ModInt operator -(ModInt a) { return new ModInt(a.Val == 0 ? 0 : _mod - a.Val); } public static ModInt operator *(ModInt a, ModInt b) { return new ModInt(a.Val * b.Val % _mod); } public static ModInt operator /(ModInt a, ModInt b) { return a * b.Inv; } public static ModInt Pow(ModInt b, long n) { long t = b.Val, r = 1; while (n > 0) { if ((n & 1) == 1) r = r * t % _mod; t = t * t % _mod; n >>= 1; } return new ModInt(r); } public ModInt Inv { get { return Pow(Val, _mod - 2); } } } long inf = (long)1 << 60; int ri { get { return (int)sc.Integer(); } } long rl { get { return sc.Integer(); } } double rd { get { return sc.Double(); } } string rs { get { return sc.Scan(); } } public StreamScanner sc = new StreamScanner(Console.OpenStandardInput()); void WriteJoin(string s, T[] t) { Console.WriteLine(string.Join(s, t)); } void WriteJoin(string s, List t) { Console.WriteLine(string.Join(s, t)); } void Write(T t) { Console.WriteLine(t.ToString()); } void YN(bool t) { Console.WriteLine(t ? "YES" : "NO"); } void Yn(bool t) { Console.WriteLine(t ? "Yes" : "No"); } void yn(bool t) { Console.WriteLine(t ? "yes" : "no"); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } private readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) throw new EndOfStreamException(); if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public long Integer() { long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public double Double() { return double.Parse(Scan()); } }