import java.util.Scanner;

public class Main {
	public static boolean isPrime(int num) {
		if (num == 1)
			return false;
		if (num == 2)
			return true;
		//去掉偶數。
		if (num % 2 == 0)
			return false;
		//i*i<num條件自己要理解。
		for (int i = 3; i * i <= num; i = i + 2) {
			if (num % i == 0)
				return false;
		}
		return true;
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int numflag = 0;
		int sum = 1;
		for (int i = 2; numflag < N; i++) {
			if (isPrime(i)) {
				sum *= i;
				sum %= 50000;
				numflag++;
			}
		}
		System.out.println(sum);
	}
}