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;
template <class F, class T>
T convert(F a, int p = -1) {
  stringstream ss;
  if (p >= 0) ss << fixed << setprecision(p);
  ss << a;
  T r;
  ss >> r;
  return r;
}
template <class T>
T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T cube(T x) {
  return x * x * x;
}
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return s == 0 ? 0 : cntbit(s >> 1) + (s & 1);
}
const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
  if (rsz <= 0) {
    ptr = 0;
    rsz = (int)fread(bf, 1, bfsz, stdin);
    if (rsz <= 0) return EOF;
  }
  --rsz;
  return bf[ptr++];
}
void ga(char &c) {
  c = EOF;
  while (!isalpha(c)) c = gc();
}
int gs(char s[]) {
  int l = 0;
  char c = gc();
  while (isspace(c)) c = gc();
  while (c != EOF && !isspace(c)) {
    s[l++] = c;
    c = gc();
  }
  s[l] = '\0';
  return l;
}
template <class T>
bool gi(T &v) {
  v = 0;
  char c = gc();
  while (c != EOF && c != '-' && !isdigit(c)) c = gc();
  if (c == EOF) return false;
  bool neg = c == '-';
  if (neg) c = gc();
  while (isdigit(c)) {
    v = v * 10 + c - '0';
    c = gc();
  }
  if (neg) v = -v;
  return true;
}
const double PI = acos(-1.0);
const double eps = 1e-9;
const int inf = (int)1e9 + 5;
const long long linf = (long long)1e17 + 5;
const long long mod = 10003;
int n;
pair<long double, long double> P[1005];
bool f[10005];
int x;
long double dist(pair<long double, long double> P0,
                 pair<long double, long double> P1) {
  return sqrt(sqr(P0.first - P1.first) + sqr(P0.second - P1.second));
}
bool makePolygon() {
  memset(f, 0, sizeof(f));
  P[0] = make_pair(0.0, 0.0);
  long double g = 0;
  for (int i = (1); i <= (n); ++i) {
    while (true) {
      x = rand() % 500;
      if (!f[x]) {
        break;
      }
    }
    f[x] = 1;
    long double d = 200 + x * 1.0 / 300;
    if (i != n) {
      P[i].first = P[i - 1].first + d * cos(g);
      P[i].second = P[i - 1].second + d * sin(g);
    } else {
      P[i].second = 0;
      d = (P[i].second - P[i - 1].second) / sin(g);
      P[i].first = P[i - 1].first + d * cos(g);
    }
    g += (PI + PI) / n;
  }
  vector<long double> V;
  for (int i = (1); i <= (n); ++i) V.push_back(dist(P[i], P[i % n + 1]));
  sort((V).begin(), (V).end());
  for (int i = 0; i < (((int)(V).size()) - 1); ++i) {
    if (V[i + 1] - V[i] < 0.0015) return false;
  }
  return true;
}
int main() {
  srand(time(NULL));
  cin >> n;
  if (n <= 4) {
    cout << "No solution";
    return 0;
  }
  while (true) {
    if (makePolygon()) break;
  }
  cout << fixed << setprecision(6);
  for (int i = (1); i <= (n); ++i)
    cout << P[i].first << " " << P[i].second << endl;
  return 0;
}