#include<stdio.h>
int n,L,C,i,j,a[260];
void read(),solve();
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("lacate.in","r",stdin);
	freopen("lacate.out","w",stdout);
	scanf("%d",&n);
}
void solve()
{
	L=(n*(n-1))/2;
	C=n-1;
	printf("%d %d\n",L,C);
	for(i=1;i<=n;i++)
	{
		for(j=1;j<i-1;j++)
			a[j]++;
		a[i]=a[n-1]+1;
		for(j=i+1;j<=C;j++)a[j]=a[j-1]+1;
		for(j=1;j<C;j++)printf("%d ",a[j]);
		printf("%d\n",a[C]);
	}
}