#include<fstream>
#include<algorithm>
using namespace std;
int n,i,v[20],viz[20],j,rez;
int valid()
{
	int i;
	for(i=2;i<=n;i++)
		if(abs(v[i]-v[i-1])>2)return 0;
	return 1;
}
int main()
{
	ifstream f("12perm.in");ofstream g("12perm.out");
	f>>n;
	 for(i=1;i<=n;i++)v[i]=i;
	 do
	 {
		if(valid()) { viz[v[1]]++; rez++; }
	 } 
	 while(next_permutation(v+1,v+n+1));
	 g<<rez;
	f.close();g.close();
return 0;}