#include <iostream>
#include <vector>
using namespace std;

// 快速计算欧拉函数 φ(n)
long long euler_phi(long long n) {
    long long result = n;
    for (long long p = 2; p * p <= n; p++) {
        if (n % p == 0) {
            while (n % p == 0) n /= p;
            result -= result / p;
        }
    }
    if (n > 1) result -= result / n;
    return result;
}

// 计算完美图的数量
long long count_perfect_graphs(long long n, long long mod) {
    long long result = 1;  // 初始值为 1，因为 n=2 时有一个完美图
    for (long long i = 2; i <= n; i++) {
        result = (result * euler_phi(i)) % mod;
    }
    return result;
}

int main() {
    long long n;
    const long long mod = 998244353;
    cin >> n;
    cout << count_perfect_graphs(n, mod) << endl;
    return 0;
}