Codeoforces 558 B. Duff in Love

//

 

B. Duff in Love

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard 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.

Sample test(s)

input

10

output

10

input

12

output

6

Note

In first sample case, there are numbers 1, 2, 5 and 10 in the shop. 10 isn't divisible by any perfect square, so 10 is lovely.

In second sample case, there are numbers 1, 2, 3, 4, 6 and 12 in the shop. 12 is divisible by 4 = 22, so 12 is not lovely, while 6 is indeedlovely.

题目大意：

给你一个数 n，然后找它所有因子数中没有 平方数 的最大值

题解：每次寻找能被整除的平方数，再除去后递归

#include <stdio.h>
#define ll __int64
ll f(ll n)
{
    ll i, t;
   ;i*i<=n;i++)
        )
        {
        t = i;
        break;
        }
    if(i*i>n)
        return n;
    else
        return f(n/t);
}
int main()
{
    ll n;
    scanf("%I64d", &n);
    printf("%I64d\n", f(n));
    ;
}