#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>

typedef long long int ll;
using namespace std;
#define INF 1234567890
#define N 200000

const int LIMIT = 1e+9;
int n, m;

bool a[30], b[30], c[30];

void solve(int here) {
	if (here == n) {
		m++;
		return;
	}
	for (int i = 0; i < n; i++) {
		if (a[i] || b[i + here] || c[here - i + n - 1]) continue;
		a[i] = b[i + here] = c[here - i + n - 1] = true;
		solve(here + 1);
		a[i] = b[i + here] = c[here - i + n - 1] = false;
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin >> n;
	solve(0);
	cout << m;


	return 0;
}