Problem: 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.

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 "xi yi" 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).

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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int Inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const double pi = acos(-1), eps = 1e-2;
mt19937 Rand(chrono::steady_clock::now().time_since_epoch().count());
double inline randf(int l, int r) {
  return uniform_real_distribution<double>(l, r)(Rand);
}
struct Point {
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator+(const Point &p) const { return Point(x + p.x, y + p.y); }
  Point operator-(const Point &p) const { return Point(x - p.x, y - p.y); }
  Point operator*(const double &p) const { return Point(x * p, y * p); }
  double inline operator*(const Point &p) const { return x * p.y - y * p.x; }
  double length() { return sqrt(x * x + y * y); }
} p[105];
double dist(Point a, Point b, Point x) {
  return fabs((a - x) * (b - x)) / (b - a).length();
}
Point inline inter(Point aa, Point ab, Point ba, Point bb) {
  Point p1 = aa, v1 = ab - aa;
  Point p2 = ba, v2 = bb - ba;
  return p1 + v1 * (((p2 - p1) * v2) / (v1 * v2));
}
int n;
Point v[105];
double val[105];
bool check() {
  for (int i = 0; i < (n); ++i)
    for (int j = 0; j < (i); ++j)
      if (fabs(val[j] - val[i]) < 1e-2) return 0;
  return 1;
}
int main() {
  scanf("%d", &n);
  if (n <= 4) return puts("No solution"), 0;
  double th = pi * 2 / n;
  for (int i = 0; i < (n); ++i) v[i] = Point(cos(th * i), sin(th * i));
  while (1) {
    Point sm;
    for (int i = (2); i <= (n - 1); ++i)
      val[i] = randf(-11.451, 11.451) + 114.514, sm = sm + v[i] * val[i];
    if (fabs(v[1].y) < eps) continue;
    val[1] = -sm.y / v[1].y;
    if (val[1] < 2.33) continue;
    sm = sm + v[1] * val[1];
    val[0] = -sm.x;
    if (val[0] < 2.33) continue;
    sm = sm + v[0] * val[0];
    if (!check()) continue;
    sm = Point(0, 0);
    for (int i = 0; i < (n); ++i) {
      printf("%.3lf %.3lf\n", sm.x, sm.y);
      sm = sm + v[i] * val[i];
    }
    break;
  }
  return 0;
}