#![allow(non_snake_case, unused_imports, unused_must_use)] use std::io::{self, prelude::*}; use std::str; fn main() { let (stdin, stdout) = (io::stdin(), io::stdout()); let mut scan = Scanner::new(stdin.lock()); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! input { ($T: ty) => { scan.token::<$T>() }; ($T: ty, $N: expr) => { (0..$N).map(|_| scan.token::<$T>()).collect::>() }; } let N = input!(usize); let is_prime = sieve_of_eratosthenes(100_010); let primes = (0..100_010).filter(|&i| is_prime[i]).collect::>(); let mut gcds = primes[0..N - 1].iter().map(|&p| p).collect::>(); gcds.reverse(); let mut ans = vec![0; N]; ans[0] = 1 * gcds[0]; for i in 1..N { let prev = ans[i - 1]; if i < N - 1 { let g1 = gcds[i - 1]; let g2 = gcds[i]; for k in (1..100_010) { if gcd(prev, g1 * g2 * k) == g1 && prev < g1 * g2 * k { ans[i] = g1 * g2 * k; break; } } } else { let g1 = gcds[i - 1]; for k in (1..100_010) { if gcd(prev, g1 * k) == g1 && prev < g1 * k { ans[i] = g1 * k; break; } } } } writeln!( out, "{}", ans.iter() .map(|x| x.to_string()) .collect::>() .join(" ") ); } fn sieve_of_eratosthenes(n: usize) -> Vec { let mut ret = vec![true; n + 1]; ret[0] = false; ret[1] = false; for p in 2..=n { if !ret[p] { continue; } for q in (2 * p..=n).step_by(p) { ret[q] = false; } } return ret; } fn gcd(a: usize, b: usize) -> usize { if a < b { return gcd(b, a); } if b == 0 { return a; } else { return gcd(b, a % b); } } struct Scanner { reader: R, buf_str: Vec, buf_iter: str::SplitWhitespace<'static>, } impl Scanner { fn new(reader: R) -> Self { Self { reader, buf_str: vec![], buf_iter: "".split_whitespace(), } } fn token(&mut self) -> T { loop { if let Some(token) = self.buf_iter.next() { return token.parse().ok().expect("Failed parse"); } self.buf_str.clear(); self.reader .read_until(b'\n', &mut self.buf_str) .expect("Failed read"); self.buf_iter = unsafe { let slice = str::from_utf8_unchecked(&self.buf_str); std::mem::transmute(slice.split_whitespace()) } } } }