Degree#753
To test her students' ability to count, Maria Ivanovna gives them the same task every year: for a given natural number , find the smallest natural number such that to the power of ( multiplied by itself times) is divisible by . The only thing that changes from year to year and from student to student is the number .
You have decided to help future generations by writing a program to solve this problem.
The input contains a single number (1 \leq A \leq 1000000000). This is just in case Maria Ivanovna decides to give someone a large number to trip them up.
Output a single integer .
Example 1