Codeforces Round #326 (Div. 2)B. Duff in Love-CSDN博客

本博客探讨了如何在给定的数字因子集合中找到最大的非平方整数。通过逐层扫描，剔除所有能被平方数整除的因子，最终确定最大的独特数。

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² is a divisor of x.

$\text{[math]}$

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 ≤ 10¹²).

Output

Print the answer in one line.

Sample test(s)

Input

Output

Input

Output

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

题目大意：在n的所有因子中找出，不能被任何平方数整除的，最大的数

解题思路：从2开始一层循环扫到i*i<=n时，碰到可以整除的，就除一个i

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#define LL long long
const int MAX=1<<30;
using namespace std;
int main()
{
  // freopen("in.txt","r",stdin);
  LL n;
  cin>>n;
  for(LL i=2;i*i<=n;i++)
  {
      while(n%(i*i)==0)
        n/=i;
  }
  cout<<n<<endl;
  return 0;
}

一点小问题吧：一开始没写成while，写成if，就没法把含有多个i*i因子去干净