跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1529. Duff in Love

    ID: 1535 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 3 上传者: 标签>数学基础难度共享题库Codeforces英文题面题目来源题面语言

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.

Examples
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 indeed lovely.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1044 题。保留原作者与原赛事署名。