#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;

template<class T>
bool chmax(T& p, T q) {
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
template<class T>
bool chmin(T& p, T q) {
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll gcd(ll(a), ll(b)) {
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll modPow(long long a, long long n, long long p) {
  if (n == 0) return 1; // 0乗にも対応する場合
  if (n == 1) return a % p;
  if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
  long long t = modPow(a, n / 2, p);
  return (t * t) % p;
}


int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll N;
    cin>>N;
    cout<<2*N-1<<endl;
    vvll AN(2*N-1,vll(N,2*N-1));
    rep(j,N-1){
        if(j%2==0){
            rep(k,2*N-1){
                if(k<=j){
                    AN[k][j+1]=j+1;
                }
                else{
                    AN[k][j+1]=2*N-j-2;
                }
            }
        }
        else{
            rep(k,2*N-1){
                if(k>=2*N-j-2){
                    AN[k][j+1]=j+1;
                }
                else{
                    AN[k][j+1]=2*N-j-2;
                }
            }
        }
    }
    rep(i,2*N-1){
        rep(k,N){
            cout<<AN[i][k]<<(k==N-1?"\n":" ");
        }
    }
}