#include<iostream>
#include<cstdio>
using namespace std;
int A[301];
int B[201][201]={0};
int ans=0;
int n;
inline void dfs(int x);
int main()
{
	freopen("checker.in","r",stdin);
	freopen("checker.out","w",stdout);
	cin>>n;
	dfs(1);
	cout<<ans;
	return 0;
}
inline void dfs(int x)
{
	if(x==n+1)
	{
		ans++;
		if(ans<=3)
		{
			for(int i=1;i<=n;++i)
			{
				cout<<A[i]<<' ';
				
			}
		}
		cout<<endl;
	}
	else
	{
		for(int i=1;i<=n;++i)
		{
			if(!B[0][i]&&!B[1][i+x]&&!B[2][x+n-i])
			{
				A[x]=i;
				B[0][i]=1;
				B[1][i+x]=1;
				B[2][x+n-i]=1;
				dfs(x+1);
				B[0][i]=0;
				B[1][i+x]=0;
				B[2][x+n-i]=0;
			}
		}
	}
}