给定一个自然数 $n$。找到 $n$ 的最小倍数，该倍数是一个自然数的平方。
Input Format
输入的第一行也是唯一一行包含一个自然数 $n$ (1 ≤ $n$ ≤ 500 000 000)。
Output Format
输出的第一行也是唯一一行应包含最小的自然数 $m$，该数是 $n$ 的倍数，同时也是一个自然数的平方。
Examples
Input
24
Output
144
Input 2
9851900
Output 2
970599336100
QOJ.ac
QOJ
As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
Time Limit:
1 s
Memory Limit:
128 MB
Total points:
10
#6065. Kwadrat
統計
この問題は以下のコンテストで使用されています：
Discussions
About Discussions
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
Open Discussions 0
No discussions in this category.
Issues
About Issues
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines:
- This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
- Do not submit duplicated issues. Submitting multiple issues may cause your account to be banned.
- Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.