#include<bits/stdc++.h>
using namespace std;
long long prime[15000],n;
bool is_prime[15000];
void  work(){
	int p=0;
	for(int i=0;i<=15000;i++)is_prime[i]=true;
	is_prime[0]=is_prime[1]=0;
	for(int i=2;i<=15000;i++){
		if(is_prime[i]){
			prime[p++]=i;
			for(int j=2*i;j<=15000;j+=i)is_prime[j]=0;
		}
	}
}
int main(){
	freopen("prime.in","r",stdin);
	freopen("prime.out","w",stdout);
	scanf("%d",&n);
	work();
	for(int i=0;i<=15000;i++){
		//printf("%d\n",prime[i]);
		//if(!prime[i])break;
		if(n/prime[i]*prime[i]==n){
			printf("%d\n",n/prime[i]);
			break;
		}
	}
	return 0;
}