import std.array;
import std.string;
import std.algorithm;
import std.stdio;
import std.conv;

void main()
{
    long x = readln.chomp.to!long;
    long[long] primes;
    for (long i = 2; i * i <= x; ++i) {
        while (x % i == 0) {
            primes[i]++;
            x /= i;
        }
    }
    if (x != 1) primes[x] = 1;

    long ans = 1;
    foreach (k, n; primes) {
        if (n % 2 == 1) {
            ans *= k;
        }
    }
    ans.writeln;
}