#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;

int main()
{
	int n;
	cin >> n;
	cout << n * 2 - 1 << endl;
	int r = n;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			cout << r + n - 1 << " ";
			r = (r + 1) % (n + 1);
		}
		cout << endl;
	}
	priority_queue<P> que;
	for(int i = 1; i < n - 1; i++) que.push(P(i, i));
	for(int i = n - 1; i < n * 2 - 1; i++) que.push(P(i - (n - 1), i));
	que.push(P(n - 1, n * 2 - 1));
	for(int i = 0; i < n - 1; i++){
		vector<P> v;
		for(int j = 0; j < n; j++){
			v.push_back(que.top());
			que.pop();
			v.back().first--;
		}
		for(P p : v){
			cout << p.second << " ";
			que.push(p);
		}
		cout << endl;
	}
}