import math

def solve(N):
    total_sum = 0
    MOD = 998244353
    
    r = 1
    while r * r <= N:
        start = r * r
        end = min((r + 1) * (r + 1) - 1, N)
        
        higher_root_prod = 1
        for k in range(3, 62):
            root_k = int(end**(1/k) + 1e-12)
            if root_k < 2: 
                break
            higher_root_prod *= root_k
        
        num_terms = (end - start + 1)
        sum_i = (num_terms * (start + end)) // 2
        
        term_contribution = (sum_i % MOD) * (r % MOD) * (higher_root_prod % MOD)
        total_sum = (total_sum + term_contribution) % MOD
        
        r += 1
        
    return total_sum

N = int(input())
print(solve(N))