#include<stdio.h>
#include<deque>
using namespace std;

int n,ans;

bool flag;

int main()
{
	freopen("xqz.in","r",stdin);
	freopen("xqz.out","w",stdout);
	int i,j,k,tmp;
	deque<int> a,b,c,d;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		a.push_back(i);
	flag=true;
	while(flag)
	{
		ans++;
		for(i=1;i<=12;i++)
		{
			for(j=1;j<=12;j++)
			{
				for(k=1;k<=5;k++)
				{
					tmp=a.front();
					a.pop_front();
					b.push_back(tmp);
				}
				tmp=b.back();
				b.pop_back();
				c.push_back(tmp);
				for(k=1;k<=4;k++)
				{
					tmp=b.back();
					b.pop_back();
					a.push_back(tmp);
				}
			}
			tmp=c.back();
			c.pop_back();
			d.push_back(tmp);
			for(j=1;j<=11;j++)
			{
				tmp=c.back();
				c.pop_back();
				a.push_back(tmp);
			}
		}
		k=d.back();
		d.pop_back();
		for(i=1;i<=11;i++)
		{
			tmp=d.back();
			d.pop_back();
			a.push_back(tmp);
		}
		a.push_back(k);
		flag=false;
		for(i=0;i<n;i++)
		{
			if(a[i]!=i+1)
			{
				flag=true;
				break;
			}
		}
	}
	printf("%d\n",(ans+1)/2);
	return 0;
}