import java.util.*;
import java.io.*;

public class Main {
    static final int MOD = 998244353;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        boolean[] isNotPrime = new boolean[n + 1];
        int[] number = new int[n + 1];
        for (int i = 2; i <= n; i++) {
            number[i] = i;
            if (!isNotPrime[i]) {
                for (int j = 2; j * i <= n; j++) {
                    isNotPrime[j * i] = true;
                }
            }
        }
        int max = 0;
        for (int i = n; i >= 2; i--) {
            if (!isNotPrime[i]) {
                max = i;
                break;
            }
        }
        long ans = 1;
        for (int i = 2; i <= n; i++) {
            if (i == max) {
                continue;
            }
            if (number[i] <= 1) {
                continue;
            }
            ans *= number[i];
            ans %= MOD;
            for (int j = 2; j * i <= n; j++) {
                number[j * i] /= number[i];
            }
        }
        System.out.println(ans);
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public String nextLine() throws Exception {
        return br.readLine();
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}