CF306D.Polygon

Polycarpus 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.

波利卡普斯喜欢凸多边形，尤其是所有内角都相等、且所有边长互不相同的那种。请为他画出一个满足给定顶点数的此类多边形。

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

输入包含一个整数 $n$（$3 \leq n \leq 100$）—— 多边形的顶点数量。

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 106 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).

输出 n 行，每行包含正 n 边形的一个顶点的坐标 "x__i y__i"，按逆时针顺序排列。各顶点坐标的绝对值不得超过 $10^6$。各边长度需在区间 $[1,\,1000]$ 内（不一定是整数）。测试过程中对您所构造多边形的边长与角度进行相互比较时，容许误差为 $10^{-3}$。

若无解，请输出 "No solution"（不含引号）。