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 double eps = 1e-8;
int dcmp(double u) {
  if (u > eps) return 1;
  if (u < (-eps)) return -1;
  return 0;
}
struct Point {
  double x;
  double y;
  Point() {}
  Point(double u, double v) {
    x = u;
    y = v;
    return;
  }
  void input() {
    scanf("%lf%lf", &x, &y);
    return;
  }
  void output() { printf("%.9lf %.9lf ", x, y); }
  double len() { return sqrt(x * x + y * y); }
  void tolen(double u) {
    double l = len();
    x /= l;
    x *= u;
    y /= l;
    y *= u;
    return;
  }
  void rotate(double sx, double cx) {
    double x1 = x, y1 = y;
    x = x1 * cx - y1 * sx;
    y = x1 * sx + y1 * cx;
    return;
  }
};
Point er;
Point operator+(Point u, Point v) { return Point(u.x + v.x, u.y + v.y); }
Point operator-(Point u, Point v) { return Point(u.x - v.x, u.y - v.y); }
Point operator*(double u, Point v) { return Point(u * v.x, u * v.y); }
Point operator*(Point v, double u) { return Point(u * v.x, u * v.y); }
double dot(Point u, Point v) { return u.x * v.x + u.y * v.y; }
double det(Point u, Point v) { return u.x * v.y - u.y * v.x; }
struct Line {
  Point d;
  Point dir;
  Line() {}
  Line(Point d1, Point di) {
    d = d1;
    dir = di;
  }
  void makeline(Point d1, Point d2) {
    d = d1;
    dir = d2 - d1;
  }
  void input() {
    Point d1;
    Point d2;
    d1.input();
    d2.input();
    makeline(d1, d2);
  }
};
Point intersect(Line a, Line b) {
  if (dcmp(det(a.dir, b.dir)) == 0) return er;
  double t;
  t = det(b.d, b.dir) - det(a.d, b.dir);
  t /= det(a.dir, b.dir);
  return a.d + t * a.dir;
}
Point ans[200];
double sa, ca;
double al;
double pi;
int n;
int main() {
  scanf("%d", &n);
  if (n <= 4) {
    printf("No solution\n");
    return 0;
  }
  pi = atan(1) * 4;
  al = 2 * pi / (double)n;
  sa = sin(al);
  ca = cos(al);
  double len = 100;
  ans[1] = Point(0, 0);
  Point dir = Point(len, 0);
  for (int i = 2; i <= n; i++) {
    ans[i] = ans[i - 1] + dir;
    len += 0.003;
    dir.tolen(len);
    dir.rotate(sa, ca);
  }
  Line l1, l2;
  l1.d = ans[n];
  l1.dir = dir;
  l2.d = ans[1];
  l2.dir = Point(1, 0);
  Point u = intersect(l1, l2);
  ans[1] = u;
  for (int i = 1; i <= n; i++) printf("%.4lf %.4lf\n", ans[i].x, ans[i].y);
  return 0;
}