#include <bits/stdc++.h>
using namespace std;
inline bool check(int n)
{
	for(int i=2;i*i<=n;i++)
		if(n%i==0) return 0;
	return 1;
}
vector <int> v[100005];
int p1[100005],p2[100005],p3[100005];
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	if(check(n))
	{
		cout << "-1";
		return 0;
	}
	if(n%2==0)
	{
		int x=n/2,qwq=-1;
		for(int i=1;i<=x;i++)
			v[i].push_back(qwq+=2);
		for(int i=x;i>=1;i--)
			v[i].push_back(qwq+=2);
		cout << x << "\n";
		for(int i=1;i<=x;i++)
		{
			cout << v[i].size();
			for(auto t:v[i]) cout << " " << t;
			cout << "\n";
		}
		return 0;
	}
	int x=0;
	for(int i=3;i<=n;i++)
	{
		if(n%i==0)
		{
			x=i;
			break;
		}
	}
	int y=x;
	x=n/x;
	int l=1,r=n+n-1;
	while(y>3)
	{
		y-=2;
		for(int i=1;i<=x;i++) v[i].push_back(l),l+=2;
		for(int i=x;i>=1;i--) v[i].push_back(r),r-=2;
	}
	for(int i=1;i<=x;i++) p1[i]=i;
	int qwq=1;
	for(int i=1;i<=x;i++)
	{
		p2[i]=qwq;
		qwq+=2;
		if(qwq>x) qwq-=x;
	}
	reverse(p2+1,p2+x+1);
	int s=(x+1)/2*3;
	for(int i=1;i<=x;i++)
		p3[i]=s-p1[i]-p2[i];
	for(int i=1;i<=x;i++)
		v[i].push_back(l+p1[i]-1);
	for(int i=1;i<=x;i++)
		v[i].push_back(l+x+p2[i]-1);
	for(int i=1;i<=x;i++)
		v[i].push_back(l+x+x+p3[i]-1);
	cout << x << "\n";
	for(int i=1;i<=x;i++)
	{
		int s=0;
		for(auto t:v[i]) s+=t;
		cout << v[i].size();
		for(auto t:v[i]) cout << " " << t;
		cout << "\n";
	}
	return 0;
}