#![allow(non_snake_case, unused_must_use, unused_imports)] use std::io::{self, prelude::*}; type MInt = modint::ModInt<998244353>; fn main() { let (stdin, stdout) = (io::read_to_string(io::stdin()).unwrap(), io::stdout()); let (mut stdin, mut buffer) = (stdin.split_whitespace(), io::BufWriter::new(stdout.lock())); macro_rules! input { ($t: ty, $n: expr) => { (0..$n).map(|_| input!($t)).collect::>() }; ($t: ty) => { stdin.next().unwrap().parse::<$t>().unwrap() }; } let N = input!(usize); assert!(N <= 10_000_000); let mut ans = MInt::default(); for m in 1..=N { for j in 1..=N { let left = m * j; let mut right = m * j + j - 1; right = std::cmp::min(right, N); if left > N { break; } ans += m * (right - left + 1); } } writeln!(buffer, "{}", ans); } #[rustfmt::skip] pub mod modint {use std::{fmt::*, ops::*};#[derive(Copy, Clone, PartialEq, Eq, Hash, Debug, Default)]pub struct ModInt(u32);impl ModInt

{ pub fn from_raw(value: u32) -> Self { assert!(value < P); Self(value) } pub fn pow(&self, mut x: u32) -> Self { let mut a = *self; let mut r = Self::from_raw(1); while x > 0 { if x & 1 == 1 { r *= a; } a *= a; x >>= 1; } r } pub fn inv(&self) -> Self { self.pow(P - 2) }}impl Add for ModInt

{ type Output = Self; fn add(self, rhs: Self) -> Self::Output { Self((self.0 + rhs.0) % P) }}impl Sub for ModInt

{ type Output = Self; fn sub(self, rhs: Self) -> Self::Output { Self((P + self.0 - rhs.0) % P) }}impl Mul for ModInt

{ type Output = Self; fn mul(self, rhs: Self) -> Self::Output { Self(((self.0 as u64 * rhs.0 as u64) % P as u64) as u32) }}impl Div for ModInt

{ type Output = Self; fn div(self, rhs: Self) -> Self::Output { self * rhs.inv() }}impl AddAssign for ModInt

{ fn add_assign(&mut self, rhs: Self) { self.0 += rhs.0; self.0 %= P; }}impl SubAssign for ModInt

{ fn sub_assign(&mut self, rhs: Self) { self.0 += P - rhs.0; self.0 %= P; }}impl MulAssign for ModInt

{ fn mul_assign(&mut self, rhs: Self) { *self = self.clone() * rhs; }}impl DivAssign for ModInt

{ fn div_assign(&mut self, rhs: Self) { *self *= rhs.inv() }}impl Neg for ModInt

{ type Output = Self; fn neg(self) -> Self::Output { Self((P - self.0) % P) }}impl Display for ModInt

{ fn fmt(&self, f: &mut Formatter<'_>) -> Result { write!(f, "{}", self.0) }}macro_rules! impl_op_for_modint { ($($t: ty), *) => { $( impl From<$t> for ModInt

{ fn from(value: $t) -> Self { Self((P as $t + value % P as $t) as u32 % P) } } impl Add<$t> for ModInt

{ type Output = Self; fn add(self, rhs: $t) -> Self::Output { self + Self::from(rhs) } } impl Add> for $t { type Output = ModInt

; fn add(self, rhs: ModInt

) -> Self::Output { Self::Output::from(self) + rhs } } impl Sub<$t> for ModInt

{ type Output = Self; fn sub(self, rhs: $t) -> Self::Output { self - Self::from(rhs) } } impl Sub> for $t { type Output = ModInt

; fn sub(self, rhs: ModInt

) -> Self::Output { Self::Output::from(self) - rhs } } impl Mul<$t> for ModInt

{ type Output = Self; fn mul(self, rhs: $t) -> Self::Output { self * Self::from(rhs) } } impl Mul> for $t { type Output = ModInt

; fn mul(self, rhs: ModInt

) -> Self::Output { Self::Output::from(self) * rhs } } impl Div<$t> for ModInt

{ type Output = Self; fn div(self, rhs: $t) -> Self::Output { self / Self::from(rhs) } } impl Div> for $t { type Output = ModInt

; fn div(self, rhs: ModInt

) -> Self::Output { Self::Output::from(self) / rhs } } impl AddAssign<$t> for ModInt

{ fn add_assign(&mut self, rhs: $t) { *self += Self::from(rhs) } } impl SubAssign<$t> for ModInt

{ fn sub_assign(&mut self, rhs: $t) { *self -= Self::from(rhs) } } impl MulAssign<$t> for ModInt

{ fn mul_assign(&mut self, rhs: $t) { *self *= Self::from(rhs) } } impl DivAssign<$t> for ModInt

{ fn div_assign(&mut self, rhs: $t) { *self /= Self::from(rhs) } } )* };}impl_op_for_modint!(usize, isize, u64, i64, u32, i32);}