Given a no N, the task is to find the largest prime factor of the number.
The first line of input contains an integer T, denoting the no 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.