#include<bits/stdc++.h>
using namespace std;
int m[300][300];
int val=1,n;
int main()
{
    freopen("lacate.in","r",stdin);
    freopen("lacate.out","w",stdout);
    scanf("%d",&n);
    int y=((n*(n-1))>>1);
    printf("%d %d\n",y,(n-1));
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<n;j++)
        {
            m[i][j]=val;
            m[j+1][i]=val;
            val++;
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<n;j++) printf("%d ",m[i][j]);
        printf("\n");
    }
    return 0;
}