#include<fstream>
#include<algorithm>
#include<cmath>
using namespace std;
ifstream f("12perm.in");
ofstream g("12perm.out");
int i,n,nr,a[100000];
bool ok;
void valid()
{int i,k=0,p=0;
for(i=1;i<n;++i)
	{if(abs(a[i]-a[i+1])>=3)
		p++;
	if(a[i]!=n-i+1)
		++k;}
if(k==0)
	ok=0;
if(p==0)
	++nr;
}
int main()
{f>>n;
for(i=1;i<=n;++i)
	a[i]=i;
nr=1;
ok=1;
while(ok!=0)
{next_permutation(a+1,a+n+1);
valid();
}
g<<nr<<'\n';
f.close();
g.close();
return 0;
}