#include <cstdio>
#include <cmath>


using namespace std;


int n;

void PreDo()
{
	scanf("%d",&n);
}

bool JudgeP(int x)
{
	bool tag=0;
	if(x<2)
	{
		return 0;
	}
	else
	{
		for(int i=2;i<=pow(x,0.5);i++)
		{
			if(x%i==0)
			{
				tag=1;
			}
		}
		if(tag==1)
		{
			return 0;
		}
		else
		{
			return 1;
		}
	}
}



int Find(int n)
{
	for(int i=2;i<=n;i++)
	{
		if(n%i==0&&JudgeP(i)==1)
		{
			return n/i;
		}
	}
}



int main()
{
	freopen("prime.in","r",stdin);
	freopen("prime.out","w",stdout);
	PreDo();
	printf("%d",Find(n));
	return 0;
}