import java.util.*;

public class Main {
    static final int MOD = 998244353;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] values = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            values[i] = i;
        }
        for (int i = n; i >= 1; i--) {
            if (isPrime(i)) {
                values[i] = 1;
                break;
            }
        }
        long ans = 1;
        for (int i = 2; i <= n; i++) {
            ans *= values[i];
            ans %= MOD;
            if (values[i] == 1) {
                continue;
            }
            for (int j = 2; j * i <= n; j++) {
                values[j * i] /= values[i];
            }
        }
        System.out.println(ans);
    }
    
    static boolean isPrime(int x) {
        for (int i = 2; i <= Math.sqrt(x); i++) {
            if (x % i == 0) {
                return false;
            }
        }
        return true;
    }
}