Given a number n. The task is to find the smallest number whose factorial contains at least n trailing zeroes.
Input : n = 1 Output : 5 1!, 2!, 3!, 4! does not contain trailing zero. 5! = 120, which contains one trailing zero. Input : n = 6 Output : 25 25! = 15511210043330985984000000
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 required output.
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.