#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N;
    cin >> N;
    cout << 2*N-1 << endl;
    vector<vector<int>> ans(2*N-1, vector<int>(N));

    for (int i=1; i<=N*2-1; i+=2){
        for (int j=0; j<i; j++) ans[j][i/2] = i;
    }

    for (int i=2; i<=N*2-1; i+=2){
        for (int j=0; j<i; j++) ans[2*N-2-j][N-1-i/2] = i;
    }

    for (int i=0; i<2*N-1; i++){
        for (int j=0; j<N; j++) cout << ans[i][j] << " ";
        cout << endl;
    }

    return 0;
}