fn get_primes(max: usize) -> Vec<usize> {
    let mut is_prime = vec![true; max + 1];
    is_prime[0] = false;
    is_prime[1] = false;

    for n in 2..=max {
        if !is_prime[n] {
            continue;
        }
        if n * n > max {
            break;
        }
        for i in ((n * n)..=max).step_by(n) {
            is_prime[i] = false;
        }
    }

    (0..=max).filter(|&n| is_prime[n]).collect()
}

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();

    if n == 1 {
        println!("1");
    } else {
        let min = 10usize.pow(5);
        let primes: Vec<usize> = get_primes(min + 1000)
            .into_iter()
            .filter(|&p| p > min)
            .take(10)
            .collect();

        let mut answers = vec![];
        for &p1 in &primes {
            for &p2 in &primes {
                answers.push(p1 * p2);
            }
        }

        answers.sort_unstable();
        answers.dedup();

        println!("{}", answers[n - 2]);
    }
}