CF588B.Duff in Love

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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 $a^{2}$ 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.

输入格式

The first and only line of input contains one integer, $n$ ( $1<=n<=10^{12}$ ).

输出格式

Print the answer in one line.

输入输出样例

输入#1
```
10
```
输出#1
```
10
```
输入#2
```
12
```
输出#2
```
6
```

说明/提示

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=2^{2}$ , so 12 is not lovely, while 6 is indeed lovely.

首页