Problems
Pairwise different distances
Pairwise different distances
For a given natural number \textbf{N} it is required to construct the set of \textbf{N} points of the Cartesian plane with integer coordinates such that all pairwise distances between points would be different.
\InputFile
The only line of the input file contains a natural number \textbf{N} ≤ \textbf{200}, defining the number of points in a set.
\textbf{Ooutput}
In the output file you should write coordinates of points of a constructed set (each points should be in single line, its coordinates should be separated by space). Coordinates of points can not exceed \textbf{800} by absolute value. It is provided that there exists such set. If there are many sets satisfying conditions, you can output any of them.
Input example #1
1
Output example #1
0 0