#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define pb push_back
vector<int> a[300];
int n,nr,i,j,ct;
int main()
{
	FILE *in,*out;
	in=fopen("lacate.in","r");
	out=fopen("lacate.out","w");
	fscanf(in,"%d",&n);
	nr=0;
	for(i=1;i<=n;i++)
		for(j=i+1;j<=n;j++)
		{
			nr++;
			a[i].pb(nr);
			a[j].pb(nr);
		}
	/*nr=1;
	a[1].pb(1);
	a[2].pb(1);
	nr=2;
	ct=2;
	for (i=3;i<=n+1;i++)
	{
		if (i==n+1)
		{
			if (a[1].size()==a[n].size())
				break;
			i=1;
		}
		a[i].pb(nr);
		ct--;
		if (!ct)
		{
			ct=2;
			nr++;
		}
	}
	if (ct==2)
		nr--;*/
	fprintf(out,"%d %d\n",nr,a[1].size());
	for (i=1;i<=n;i++)
	{
		for(j=0;j<a[i].size();j++)
			fprintf(out,"%d ",a[i][j]);
		fprintf(out,"\n");
	}
	fclose(in);
	fclose(out);
	return 0;
}