#include <cstdio>
#include <iostream>
using namespace std;
int n,ans[40],g=0,tot=0;
bool vis[3][80];
void dfs(int x){
	if(x==n+1){
		if(g<3){
			++g;
			for(int i=1;i<n;i++)
				printf("%d ",ans[i]);
			printf("%d\n",ans[n]);
		}
		tot++;
		return;
	}
	for(int i=1;i<=n;i++){
		if(vis[0][i] || vis[1][x+i] || vis[2][i-x+n])
			continue;
		ans[x]=i;
		vis[0][i]=vis[1][x+i]=vis[2][i-x+n]=true;
		dfs(x+1);
		vis[0][i]=vis[1][x+i]=vis[2][i-x+n]=false;
	}
}
int main(){
	freopen("checker.in","r",stdin);
	freopen("checker.out","w",stdout);
	scanf("%d",&n);
	dfs(1);
	printf("%d\n",tot);
	return 0;
}