mod io { #[macro_export] macro_rules! scan { ($r:expr, [$t:tt; $n:expr]) => ((0..$n).map(|_| scan!($r, $t)).collect::>()); ($r:expr, ($($t:tt),*)) => (($(scan!($r, $t)),*)); ($r:expr, [u8]) => (io::scan($r)); ($r:expr, String) => (io::scan($r).into_iter().map(char::from).collect::()); ($r:expr, $t:ty) => (scan!($r, String).parse::<$t>().unwrap()); } pub fn scan(r: &mut R) -> Vec { let mut res = Vec::new(); loop { let buf = match r.fill_buf() { Ok(buf) => buf, Err(e) if e.kind() == std::io::ErrorKind::Interrupted => continue, Err(e) => panic!(e), }; let (done, used) = match buf.iter().position(u8::is_ascii_whitespace) { Some(i) => { res.extend_from_slice(&buf[..i]); (res.len() > 0, i + 1) } None => { res.extend_from_slice(buf); (buf.is_empty(), buf.len()) } }; r.consume(used); if done { return res; } } } } mod math { pub fn get_primes(n: usize) -> Vec { let mut primes = Vec::new(); let mut is_prime = vec![true; n + 1]; for i in 2..=n { if !is_prime[i] { continue; } primes.push(i); let mut j = i + i; while j <= n { is_prime[j] = false; j += i; } } primes } } fn run(reader: &mut R, writer: &mut W) { const MOD: usize = 998_244_353; let n = scan!(reader, usize); let primes = { let mut primes = math::get_primes(n); primes.pop(); primes }; let mut ans = 1; for p in primes { let mut x = 1; while x * p <= n { x *= p; } ans *= x; ans %= MOD; } writeln!(writer, "{}", ans).ok(); } fn main() { let (stdin, stdout) = (std::io::stdin(), std::io::stdout()); let mut reader = std::io::BufReader::new(stdin.lock()); let mut writer = std::io::BufWriter::new(stdout.lock()); run(&mut reader, &mut writer); }