#include <iostream>
#include <cmath>
long PashaDerevo(long n)
{
    long min = -1;
    for(long i = 2; i < n - 1; ++i)
        if(n % i == 0)
        {
            min = i;
            break;
        }
    if(min == -1)
        return -1;
    return n / min;
}

int main()
{
    long n;
    std::cin >> n;
    long count = 0;
    long res = PashaDerevo(n);
    if(res == -1)
        std::cout << n;
    else
        std::cout << res;
    return 0;
}