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