#include <fstream>
#include <algorithm>
#define DIM 260
#define infile "lacate.in"
#define outfile "lacate.out"

using namespace std;

ifstream f(infile);
ofstream g(outfile);

int n;

int dp[DIM][DIM];

int main() {
	f >> n;

	int cnt = 0;
	for (int i = 1; i < n; ++i)
		for (int j = i + 1; j <= n; ++j, ++cnt)
			dp[j][i] = dp[i][j - 1] = cnt;

	g << cnt << " " << n - 1 << "\n";
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j < n; ++j)
			g << dp[i][j];
		g << '\n';
	}

	return 0;
}

//Trust me, I'm the Doctor!