import math

N = int(input())
MOD = 998244353
total_sum = 0
i = 1

while i <= N:
    sqrt_i = int(i**0.5 + 1e-9)
    next_square = (sqrt_i + 1)**2
    R = min(N, next_square - 1)
    
    count = R - i + 1
    term_sum = (i + R) * count // 2
    
    prod_k = 1
    k = 2
    while True:
        root_k = int(pow(i, 1/k) + 1e-9)
        if root_k <= 1:
            break
        prod_k = (prod_k * root_k) % MOD
        k += 1
        
    total_sum = (total_sum + (term_sum % MOD) * prod_k) % MOD
    i = R + 1
    
print(total_sum)