#include<bits/stdc++.h>
using namespace std;
struct apple
{
	long long he;
	vector<int>g;
	bool operator<(const apple &other)const
	{
		return he<other.he;
	}
}e[100005];
int cmp(int a,int b)
{
	return e[a].he<e[b].he;
}
int main()
{
	int n,flag=0;
	cin>>n;
	for(int i=n-1;i>=2;i--)if(n%i==0)flag=i;
	if(!flag)cout<<-1<<endl;
	else
	{
		if(n%2==0)
		{
			printf("%d\n",n/2);
			for(int i=1;i<=n/2;i++)printf("%d %d %d\n",2,i,n-i+1);
		}else
		{
			int x=flag,y=n/flag;
			cout<<y<<endl;
			for(int i=1;i<=y;i++)
			{
				e[i].g.push_back(2*i-1);
				int D=y+(i+y/2)%y+1;
				e[i].g.push_back(2*D-1);
				e[i].he=2*i-1+2*D-1;
			}
			sort(e+1,e+y+1);
			for(int i=1;i<=y;i++)
			{
				printf("%d",x);
				for(int j=0;j<2;j++)printf(" %d",e[i].g[j]);
				int D=3*y-i+1;
				printf(" %d",2*D-1);
				for(int j=4;j<=x;j+=2)
				{
					int D1=(j-1)*y+i+1,D2=(j-1)*y+(y-i)+1;
					printf(" %d %d",2*D1-1,2*D2-1);
				}
				printf("\n");
			}
		}
	}
	return 0;
}