AtCoder Regular Contest 118
C
Coprime Set
AtCoder
⌀ 1151
原题
← BD →
翻译中…

Problem Statement

翻译中…

Given is a positive integer $N$. Print an integer sequence $A = (A_1, A_2, \ldots, A_N)$ satisfying all of the following:

翻译中…
  • $1\leq A_i\leq 10000$;
  • $A_i\neq A_j$ and $\gcd(A_i, A_j) > 1$ for $i\neq j$;
  • $\gcd(A_1, A_2, \ldots, A_N) = 1$.
翻译中…

We can prove that, under the Constraints of this problem, such an integer sequence always exists.

翻译中…

Constraints

翻译中…
  • $3\leq N\leq 2500$
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

N

翻译中…

Output

翻译中…

Print the elements in your integer sequence $A$ satisfying the conditions in one line, with spaces in between.

翻译中…

A_1 A_2 \ldots A_N

翻译中…

If multiple sequences satisfy the conditions, any of them will be accepted.

翻译中…

样例

Input #1
4
Output #1
84 60 105 70
All of the conditions are satisfied, since we have: - $\gcd(84,60) = 12$ - $\gcd(84,105) = 21$ - $\gcd(84,70) = 14$ - $\gcd(60,105) = 15$ - $\gcd(60,70) = 10$ - $\gcd(105,70) = 35$ - $\gcd(84,60,105,70) = 1$
题目信息
题号
arc118_c
时间限制
2 s
内存限制
1024 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。