Given a number N find the product of all unique prime factors of that number.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the number N for which the result is to be calculated.
Print the product of the unique prime factors for each number in a new line.
1<= T <=100
1<= N <=100000
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.