#include <cstdio>
using namespace std;

    long i,j,n,p,T[300][300];

int main()
{
    freopen ("lacate.in","r",stdin);
    freopen ("lacate.out","w",stdout);
    scanf ("%d", &n );
    printf("%d %d\n", (n*(n-1)/2),(n-1));
    for ( i=1; i<n; i++ )
    {
        for ( j=i; j<n; j++ )
        {
            p++;
            T[i][j]=p;
            T[j+1][i]=p;
            
        }
    }
    for ( i=1; i<=n; i++,printf("\n") )
        for ( j=1; j<n; j++ )
            printf("%d ",T[i][j]);
        
    return 0;
}