Solution - Codeforces Problem 327B - Hungry Sequence

B. Hungry Sequence

Iahub and Iahubina went to a date at a luxury restaurant. Everything went fine until paying for the food. Instead of money, the waiter wants Iahub to write a Hungry sequence consisting of n integers.

A sequence a1, a2, ..., an, consisting of n integers, is Hungry if and only if:

• Its elements are in increasing order. That is an inequality ai < aj holds for any two indices i, j (i < j).
• For any two indices i and j (i < j), aj must not be divisible by ai.

Iahub is in trouble, so he asks you for help. Find a Hungry sequence with n elements.

Input

The input contains a single integer: n (1 ≤ n ≤ 105).

Output

Output a line that contains n space-separated integers a1 a2, ..., an (1 ≤ ai ≤ 107), representing a possible Hungry sequence. Note, that each ai must not be greater than 10000000 (107) and less than 1.

If there are multiple solutions you can output any one.

Examples

input

3

output

2 9 15

input

5

output

11 14 20 27 31

Click to view Problem Online 

সল্যুশন্সঃ

#include<iostream>
using namespace std;
int main()
{
    long n;
    cin >> n;
    for(long k=n+1; k<=2*n; k++)
        cout << k << " ";
    cout << endl;
    return 0;
}

আলোচনাঃ