给定一个自然数 $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
الإحصائيات
تم استخدام هذه المسألة في المسابقات التالية:
About Issues
We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.
You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.
STOP! Before you submit an issue, please READ the following guidelines:
- This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
- Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
- Issues must be filed in English or Chinese only.
- Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.