#include<bits/stdc++.h>//上头文件
using namespace std;
int n,cnt,hang[15];//
bool xie[26],lie[15],xie2[45];
void dfs(int u){
	if(u==n+1){
		cnt++;
		if(cnt<=3){//输出
			for(int i=1;i<=n;i++){
				cout<<hang[i]<<" ";
			}
			cout<<"\n";
		}
	}
	else{
		for(int i=1;i<=n;i++){
			if(xie[u+i]==0&&lie[i]==0&&xie2[u-i+n]==0){
				hang[u]=i;
				xie[u+i]=1;
				xie2[u-i+n]=1;
				lie[i]=1;
				dfs(u+1);
				xie[u+i]=0;
				xie2[u-i+n]=0;
				lie[i]=0;
			}
		}
	}

}
int main(){
	cin>>n;
	dfs(1);
	cout<<cnt;
	return 0;
}