// PowerOJ1739#include<algorithm>#include<iostream>#include<cstring>#include<cstdlib>#include<cstdio>#include<cmath>#include<queue>#define LL long long#define inf 2147483640#define Pi acos(-1.0)#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);using namespace std;const int maxn=100010;struct edge {int to,next;}e[maxn*10];int head[maxn],p[maxn],vis[maxn],d[maxn];int cnt,n;void link(int u,int v) {	e[++cnt]=(edge){v,head[u]};head[u]=cnt;}bool match(int x,int mx) {	vis[x]=cnt;	for (int i=head[x];i;i=e[i].next) if (e[i].to<=mx && vis[e[i].to]!=cnt) {			vis[e[i].to]=cnt;			if (!p[e[i].to] || match(p[e[i].to],mx)) {p[e[i].to]=x;return 1;}		}	return 0;}void dfs(int x) {	vis[x]=cnt;	for (int i=head[x];i;i=e[i].next) if (d[e[i].to]==x) dfs(e[i].to);}bool check(int mid) {	int res=0;	for (int i=1;i<=mid;i++) p[i]=0;	for (int i=1;i<=mid;i++) {		cnt++;		if (match(i,mid)) res++;	}	return mid-res<=n;}void print(int ans) {	printf("%d\n",ans);	memset(vis,0,sizeof(vis));cnt=0;	for (int i=1;i<=ans;i++) if (!d[i] && !vis[i]) {			cnt++;			dfs(i);		}	for (int i=1;i<=cnt;i++) {		for (int j=1;j<=ans;j++) if (vis[j]==i) printf("%d ",j);		puts("");	}}int main() {	scanf("%d",&n);	for (int i=1;i<=2000;i++)		for (int j=i+1;j<=2000;j++)			if (sqrt(i+j)*sqrt(i+j)==i+j) link(i,j);	int l=1,r=2000,ans;cnt=0;	while (l<=r) {		int mid=(l+r)>>1;		if (check(mid)) {			for (int i=1;i<=mid;i++) d[i]=p[i];			ans=mid,l=mid+1;		}		else r=mid-1;	}	print(ans);    return 0;}