Please enter your email address or userHandle.
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!
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.