Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Polygon

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPolycarpus loves convex polygons, especially if all their angles are the same and all their sides are different. Draw for him any such polygon with the given number of vertexes.

Input

The input contains a single integer *n* (3 ≤ *n* ≤ 100) — the number of the polygon vertexes.

Output

Print *n* lines, containing the coordinates of the vertexes of the *n*-gon "*x*_{i} *y*_{i}" in the counter clockwise order. The coordinates of the vertexes shouldn't exceed 10^{6} in their absolute value. The side lengths should fit within limits [1, 1000] (not necessarily integer). Mutual comparing sides and angles of your polygon during the test will go with precision of 10^{ - 3}.

If there is no solution, print "No solution" (without the quotes).

Examples

Input

8

Output

1.000 0.000

7.000 0.000

9.000 2.000

9.000 3.000

5.000 7.000

3.000 7.000

0.000 4.000

0.000 1.000

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/20/2019 19:35:06 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|