#include <bits/stdc++.h>
using namespace std;
const double pi = 3.1415926535897932384626433832795, step = 0.5;
const complex<double> I(0, 1);
const int mn = 1010;
complex<double> a[mn];
int n;
double R, L;
int main() {
  scanf("%d", &n);
  if (n <= 4) {
    puts("No solution");
    return 0;
  }
  R = 1000.0, L = 0.0;
  if (n <= 10) R = 500;
  for (int i = 0; i <= n - 1; ++i) a[i] = R * exp(2 * pi * i / n * I);
  for (int i = 0; i <= n - 1; ++i) {
    complex<double> u = a[(i + 1) % n] - a[i],
                    v = a[(i + 2) % n] - a[(i + 3) % n];
    L += step;
    u = u / abs(u) * L, v = v / abs(v) * L;
    a[(i + 1) % n] -= u, a[(i + 2) % n] -= v;
  }
  for (int i = 0; i <= n - 1; ++i)
    printf("%.8lf %.8lf\n", a[i].real(), a[i].imag());
  return 0;
}
