FactoriPrimi1

#include <iostream>
#define ULL unsigned long long int
using namespace std;

ULL minDivPrim(ULL n)
{
	ULL p=1;
	for(ULL d=2;d*d<=n;++d)
    {
		if(n%d==0)
        {
	  		while(n%d==0)
                n=n/d;
			p*=d;
		}
	}
	if(n>1)
        p*=n;
	if(p==1)
		return n;
	return p;
}

int main()
{
   ULL n;
   cin>>n;
   cout<<minDivPrim(n);
   return 0;
}