Given a number N. You are tasked with finding the smallest number S, such that N is a factor of S! (S factorial). N can be very large.
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.
Print the smallest number, such that N is a factor of S!