#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr double PI = acos(-1.0);

constexpr int N = 24;

int P;
double A[110][N];
double B[110][N];

void judge() {
  for (int i0 = 0; i0 < P; ++i0) for (int i1 = 0; i1 < P; ++i1) {
    vector<double> sum(N);
    for (int j = 0; j < N; ++j) {
      sum[j] = max(A[i0][j] + A[i1][j], 0.0);
    }
    double mx = -1e+100;
    int im = -1;
    for (int i = 0; i < P; ++i) {
      double dot = 0.0;
      for (int j = 0; j < N; ++j) {
        dot += B[i][j] * sum[j];
      }
      if (chmax(mx, dot)) {
        im = i;
      }
    }
    // cerr << i0 << " " << i1 << ": " << im << " " << sum << endl;
    assert((i0 + i1) % P == im);
  }
}

int main() {
  for (; ~scanf("%d", &P); ) {
    for (int i = 0; i < P; ++i) {
      for (int j = 0; j < N; j += 4) {
        A[i][j + 0] = cos(j + 2*PI/P * i);
        A[i][j + 1] = sin(j + 2*PI/P * i);
        A[i][j + 2] = -A[i][j + 0];
        A[i][j + 3] = -A[i][j + 1];
      }
    }
    for (int i0 = 0; i0 < P; ++i0) for (int i1 = 0; i1 < P; ++i1) {
      for (int j = 0; j < N; ++j) {
        // chmax(B[(i0 + i1) % P][j], A[i0][j] + A[i1][j]);
        B[(i0 + i1) % P][j] += max(A[i0][j] + A[i1][j], 0.0);
      }
    }
    for (int i = 0; i < P; ++i) {
      double dot = 0.0;
      for (int j = 0; j < N; ++j) dot += B[i][j] * B[i][j];
      dot = sqrt(dot);
      for (int j = 0; j < N; ++j) B[i][j] /= dot;
    }
    
    printf("%d\n", N);
    for (int i = 0; i < P; ++i) {
      for (int j = 0; j < N; ++j) {
        if (j) printf(" ");
        printf("%f", A[i][j]);
      }
      puts("");
    }
    puts("");
    for (int i = 0; i < P; ++i) {
      for (int j = 0; j < N; ++j) {
        if (j) printf(" ");
        printf("%f", B[i][j]);
      }
      puts("");
    }
    
    judge();
  }
  return 0;
}