Factorial and numbers
Submissions: 684   Accuracy:

8.47%

  Difficulty: Medium   Marks: 4

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.

Input:
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.

Output:
Print the smallest number, such that N is a factor of S!

Constraints:
1<=T<=100
1<=N<=10^12

Example:
Input:

2
6
800

Output:
3
10

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Ayush Govil
Author: Ayush Govil 1


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.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.