#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
const double P = acos(-1.0);
int n;
vector < array < double, 3 > > g[105] {
{}, 
{
{0.000000000, 0.000000000, 0.000000000}, {1.000000000, 0.000000000, 0.000000000}
}, 
{
{0.000000000, 0.000000000, 0.000000000}, {1.000000000, 0.000000000, 0.000000000}, {0.500000000, 0.866025404, 0.000000000}
}, 
{
{0.500000000, 0.000000000, -0.353553391}, {-0.500000000, 0.000000000, -0.353553391}, {0.000000000, 0.500000000, 0.353553391}, {0.000000000, -0.500000000, 0.353553391
}
}, 
{
{0.707106781, 0.00000000, 0.000000000}, {-0.707106781, 0.000000000, 0.000000000}, {0.000000000, 0.707106781, 0.000000000}, {0.000000000, -0.707106781, 0.000000000}, {0.000000000, 0.000000000, 0.707106781}, {0.000000000, 0.000000000, -0.707106781}
}, 
{
{0.000000000, 0.500000000, 0.809016994}, {0.000000000, -0.500000000, 0.809016994}, {0.000000000, 0.500000000, -0.809016994}, {0.000000000, -0.500000000, -0.809016994}, {0.500000000, 0.809016994, 0.000000000}, {0.500000000, -0.809016994, 0.000000000}, {-0.500000000, 0.809016994, 0.000000000}, {-0.500000000, -0.809016994, 0.000000000}, {0.809016994, 0.000000000, 0.500000000}, {0.809016994, 0.000000000, -0.500000000}, {-0.809016994, 0.000000000, 0.500000000}, {-0.809016994, 0.000000000, -0.500000000}
}
};
inline void roto (int i, int p, int q, double x, vector < array < double, 3 > > &u)
{
	double o = u[i][p], r = u[i][q];
	u[i][p] = cos(x) * o - sin(x) * r;
	u[i][q] = sin(x) * o + cos(x) * r;
}
inline void rot (double x, double y, double z, vector < array < double, 3 > > &u)
{
	for (int i = 0; i < u.size(); i = -~i)
	{
		roto(i, 1, 2, x, u); roto(i, 2, 0, y, u); roto (i, 0, 1, z, u);
	}
	return void();
}
inline vector < array < double, 3 > > solve(double x, double y, double z, vector < array < double, 3 > > &u, vector < array < double, 3 > > v)
{
	rot(1.0, 1.0, 1.0, v);
	vector < array < double, 3 > > s;
	for (auto d : u)
	{
		for (auto e : v){s.push_back({d[0] + e[0], d[1] + e[1], d[2] + e[2]});}
	}
	return s;
}
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    mt19937 rng;
    cin >> n;
    for (register int i = 6;i <= 10; i = -~i)
    {
        if (i == 10){g[i] = solve(rng() * P / rng.max(), rng() * P / rng.max(), rng() * P / rng.max(), g[4], g[6]); break;}
    	if (i & 1) g[i] = solve(rng() * P / rng.max(), rng() * P / rng.max(), rng() * P / rng.max(), g[i / 2], g[i / 2 + 1]);
    	else g[i] = solve(rng() * P / rng.max(), rng() * P / rng.max(), rng() * P / rng.max(), g[i / 2], g[i / 2]);
	}
	cout << g[n].size() << "\n";
	for (auto [x, y, z] : g[n])
	{
		cout << fixed << setprecision(10) << x << " " << y << " " << z << "\n";
	}
    return 0;
}