#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> void Max(T &m, const T q) { if (m < q) m = q; }
template<typename T> void Min(T &m, const T q) { if (m > q) m = q; }
template<typename T1, typename T2> pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int K;

vector<vector<int>> ans;


vector<int> makePrimeLst(int N)
{
    vector<int> ans;
    vector<int> alive(N+1, 1);
    lint now = 2;
    for (; now * now <= N; now++)
    {
        if (alive[now]) ans.push_back(now);
        for (int t = now; t <= N; t += now) alive[t] = 0;
    }
    for (; now <= N; now++) if (alive[now]) ans.push_back(now);
    return ans;
}

int main()
{
    cin >> K;
    int n;
    if (K == 1)
    {
        cout << 1 << endl;
        cout << 1 << endl;
        return 0;
    }
    else if (K == 2)
    {
        cout << 2 << endl;
        cout << "1 2" << endl;
        cout << "2 1" << endl;
        return 0;
    }
    else if (K % 4 == 0)
    {
        // 偶数
        n = K / 2;
        ans.resize(n, vector<int>(n));
        REP(i, n) ans[0][i] = i + 1;
        REP(i, n) ans[1][i] = i + 1 + n;
    }
    else if (K % 4 == 2)
    {
        n = K / 2 + 1;
        ans.resize(n, vector<int>(n));
        REP(i, n) ans[0][i] = i + 1;
        ans[0][n - 1] = K;
        ans[0][n - 2] = K - 1;
        REP(i, n - 2) ans[1][i + 1] = i + n - 1;
        ans[1][n - 1] = K - 1;
        ans[1][0] = K;
    }
    else if (K % 4 == 1)
    {
        n = K / 2 + 2;
        ans.resize(n, vector<int>(n));
        REP(i, n) ans[0][i] = i + 1;
        ans[0][n - 1] = K;
        ans[0][n - 2] = K - 1;
        ans[0][n - 3] = K - 2;
        REP(i, n - 3) ans[1][i + 1] = i + n - 2;
        ans[1][n - 1] = K - 1;
        ans[1][n - 2] = K - 2;
        ans[1][0] = K;
    }
    else
    {
        // 3余る奇数
        n = K / 2 + 1;
        ans.resize(n, vector<int>(n));
        REP(i, n) ans[0][i] = i + 1;
        ans[0][n - 1] = K;
        REP(i, n) ans[1][i] = n + i - 1;
        ans[1][0] = K;
    }
    FOR(i, 2, n) REP(j, n) ans[i][(j + 2) % n] = ans[i - 2][j];
    printf("%d\n", ans.size());
    REP(i, ans.size())
    {
        REP(j, ans.size()) printf("%d ", ans[i][j]);
        printf("\n");
    }
}


Measured memory_bytes: 2176