Given a positive integer $n$ such that $3 \le n \le 2000$, find $n$ positive integers between $1$ and $4\times10^7$ (both inclusive) such that all pairwise sums of those $n$ integers are distinct, or print -1 if such integers don't exist.

Input format: A single integer $n$ with the given constraints.
Output format: $n$ space separated integers satisfying the problem conditions or -1.

Problem author: Navneel Singhal