#include<iostream> #include<cmath> using namespace std; int findLargerPrime(int num) { int largerPrime = 0; for (int i=2;i<=sqrt(num);i++) { if (num%i==0) { largerPrime=max(i, num / i); } } return largerPrime; } int main() { int num; cin>>num; int largerPrime=findLargerPrime(num); cout<<largerPrime<<endl; return 0; }