#include<cstdio>
#include<map>
using namespace std;
int n,ans,a[200001];
map<unsigned,int> m;
void dfs(int step)
{
	if(step==n+1)
	{
		unsigned x=0;
		for(int i=1;i<=n;i++) x=x*2+a[i];
		if(m[x]) return;
		ans++;
 		for(int j=1;j<=n;j++)
		{
			x=0;
			for(int i=1;i<=n;i++)
			{
				if(i<=j) x=x*2+a[n-j+i];
				else x=x*2+a[i-j];
			}
			m[x]=1;
		}
		return;
	}
	a[step]=1;dfs(step+1);
	a[step]=0;dfs(step+1);
}
int main()
{
	freopen("Hescircle.in","r",stdin);
	freopen("Hescircle.out","w",stdout);
	scanf("%d",&n);
	dfs(1);
	printf("%d\n",ans);
	return 0;
}