#![allow(dead_code)] #![allow(non_snake_case)] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let mut s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } use std::collections::HashSet; fn main() { input!{ n:usize } if n == 1 { println!("{}", 1); return } let mut g = vec![true; 100100]; for i in 2..400 { if g[i] { // print!("{} ", i); for j in i..100099/i+1 { g[j*i] = false; } } } let mut f = Vec::new(); for i in 100000..100100 { if g[i] { f.push(i); } } let mut g = Vec::new(); for &x in &f { for &y in &f { g.push(x * y) } } let uniq: HashSet = g.into_iter().collect(); let mut g: Vec<&usize> = uniq.iter().collect(); g.sort(); println!("{}", g[n-2]); }