#include<iostream>
#include<cstdio>
using namespace std;
int c[100];
int n,ans;

void search(int cur){
	if(cur==n)ans++;
	else for(int i=0;i<n;i++){
		int p=1;
		c[cur]=i;
		for(int j=0;j<cur;j++)
		  if(c[cur]==c[j]||cur-c[cur]==j-c[j]||cur+c[cur]==j+c[j])p=0;
		if(p)search(cur+1);
	}
}
int main(){
	freopen("queen.in","r",stdin);
	freopen("queen.out","w",stdout);
	cin>>n;
	if(n>1&&n<4)cout<<"0";
	else{
		search(0);
		cout<<ans;
	}	
	fclose(stdin);
	fclose(stdout);
	return 0;
}