Codeforces 588B Duff in Love 【数学】

数学】"/>

Codeforces 588B Duff in Love 【数学】

题目链接：Codeforces 588B Duff in Love
B. Duff in Love
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Duff is in love with lovely numbers! A positive integer x is called lovely if and only if there is no such positive integer a > 1 such that a2 is a divisor of x.

Malek has a number store! In his store, he has only divisors of positive integer n (and he has all of them). As a birthday present, Malek wants to give her a lovely number from his store. He wants this number to be as big as possible.

Malek always had issues in math, so he asked for your help. Please tell him what is the biggest lovely number in his store.

Input
The first and only line of input contains one integer, n (1 ≤ n ≤ 1012).

Output
Print the answer in one line.

Examples
input
10