Another Sequence Problem
InterviewTime limit1sMemory limit1024 MB
Print N distinct integers from 1 to 10^9 so that for every pair, the sum of the two does not divide their product.
- Level
Medium4 of 10
- Topics
- Number theory, Math
- Solved
- No attempts yet
Problem
Print a sequence of length that satisfies the following condition.
For all integers and with , the following conditions hold.
- , and every element of is an integer from to inclusive.
- is not a divisor of .
Input
The first line contains the integer , the length of sequence . ()
Output
On the first line, print the elements of sequence separated by spaces.
If several sequences satisfy the conditions, print any of them.