CF327B 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 $ a_{1} $ , $ a_{2} $ , ..., $ a_{n} $ , consisting of $ n $ integers, is Hungry if and only if: - Its elements are in increasing order. That is an inequality $ a_{i}<a_{j} $ holds for any two indices $ i,j $ $ (i<j) $ . - For any two indices $ i $ and $ j $ $ (i<j) $ , $ a_{j} $ must not be divisible by $ a_{i} $ . Iahub is in trouble, so he asks you for help. Find a Hungry sequence with $ n $ elements.

The input contains a single integer: $ n $ ( $ 1

Output a line that contains $ n $ space-separated integers $ a_{1} $ $ a_{2} $ , ..., $ a_{n} $ $ (1