#include<stdio.h>
char a[20][20] = {0};
int l[20] = {0};//列
int p[20] = {0};//撇
int q[20] = {0};//捺
int n, k=0;

void dfs(int h) {
	int i,j;
	if(h == n) {
		k ++;
		for(i=0;i<n;i++) {
			for(j=0;j<n;j++)
			if(a[i][j] == 'Q' && k < 4) {
				printf("%d ",j+1);
			}
		}
		if(k<4)
		printf("\n");
		return;
	}
	for(i = 0;i < n;i ++) {
		if(!l[i] && !p[i+h] && !q[i-h+n]) {
			l[i] = p[i+h] = q[i-h+n] = 1;
			a[h][i] = 'Q';
			dfs(1+h);
			l[i] = p[i+h] = q[i-h+n] = 0;
			a[h][i] = '.';
		}
	}
}

int main(){
	int i, j;
	scanf("%d",&n);
	for(i = 0;i < n;i ++) {
		for(j = 0;j < n;j ++) {
			a[i][j] = '.';
		}
	}
	dfs(0);
	printf("%d",k);
	return 0;
}