#include <bits/stdc++.h>

#define int ll
using ll = long long;

using namespace std;

int n;
int m;
vector<int> ans[10];

void solve();

signed main()
{
    ios::sync_with_stdio(NULL);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

void solve()
{
    cin >> n;
    for (int i = 0; i < n; i++)
        ans[i].clear();
    m = 1;
    for (int i = 1; i <= n; i++)
        m *= i;
    vector<int> now;
    for (int i = 0; i <= n - 1; i++)
        now.push_back(i);

    int bonus = 1;
    do
    {
        for (int i = 0; i < n; i++)
        {
            ans[i].push_back(now[i] + bonus);
        }
        bonus += n;
    } while (next_permutation(now.begin(), now.end()));

    cout << m << '\n';
    for (int i = 1; i <= n; i++)
    {
        for (auto it : ans[i - 1])
        {
            cout << it << " ";
        }
        cout << '\n';
    }
}