Given a number N, the task is to find the largest prime factor of that number.
The first line of input contains an integer T, denoting the number of test cases. Then T test cases follow. Each test case contains an integer N.
For each test case, in a new line, print the largest prime factor of N.
1 <= T <= 100
2 <= N <= 1010
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.