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

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

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; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> v;
    for(int i = 1; i <= 2*n-1; i++){
        for(int j = i; j <= 2*n-1; j++){
            v.push_back(j);
        }
    }
    vector<int> buf;
    auto ans = vec2d(2*n-1, n, 0);
    for(int i = 0; i < n; i++){
        ans[i][0] = i+1;
    }
    for(int x = n+1; x <= 2*n-1; x++){
        for(int j = 0; j < x; j++){
            ans[j][x-n] = x;
        }
    }
    for(int x = 2; x <= n; x++){
        int i = n-x;
        for(int j = 0; j < x-1; j++){
            ans[2*n-j-2][i] = x;
        }
    }
    cout << 2*n-1 << endl;
    for(int i = 0; i < 2*n-1; i++) print_vector(ans[i]);
}