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 MAXN = 105;
const double PI = acos(-1);
int n;
double x[MAXN];
double y[MAXN];
double val[MAXN + 10];
int main() {
  scanf("%d", &n);
  if (n <= 4) {
    puts("No solution");
    return 0;
  }
  for (int i = 0; i < n; i++) {
    x[i] = cos(2 * PI * i / n);
    y[i] = sin(2 * PI * i / n);
  }
  while (1) {
    for (int i = 2; i < n + 10; i++)
      val[i] = rand() % 998 + 2 + 0.1 * (rand() % 10);
    sort(val + 2, val + n + 10);
    unique(val + 2, val + n + 10);
    random_shuffle(val + 2, val + n);
    double X = 0, Y = 0;
    for (int i = 2; i < n; i++) {
      X += x[i] * val[i];
      Y += y[i] * val[i];
    }
    X = -X;
    Y = -Y;
    val[1] = Y / y[1];
    X -= val[1] * x[1];
    val[0] = X / x[0];
    if (val[0] > 1 && val[1] > 1 && val[0] < 1000 && val[1] < 1000 &&
        fabs(val[0] - (int)(val[0] + 0.5)) > 1e-3 &&
        fabs(val[1] - (int)(val[1] + 0.5)) > 1e-3) {
      X = 0, Y = 0;
      for (int i = 0; i < n; i++) {
        printf("%.6lf %.6lf\n", X, Y);
        X += val[i] * x[i];
        Y += val[i] * y[i];
      }
      return 0;
    }
  }
  return 0;
}