#include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)

    typedef long long ll;
    typedef unsigned long long ull;
    using P=pair<ll,ll>;
    const int INF=1001001001;
    const ll INFL=1e18;
    const int mod=998244353;
    
    void solve(){
        int n;
        cin>>n;
        cout<<2*n-1<<endl;
        vector<vector<int>>ans(2*n-1,vector<int>(n));
        rep(i,n){
            int s=2*i+1;
            rep(j,s)ans[j][i]=s;
            int k=2*n-1-s;
            rep(j,k)ans[j+s][i]=k;
        }
        rep(i,2*n-1){
            rep(j,n){
                cout<<ans[i][j]<<" ";
            }
            cout<<endl;
        }
    }  

    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        solve(); 
        
        return 0;
    }