Given an integer N. The task is to find the number of digits that appear in its factorial, where factorial is defined as, factorial(n) = 1*2*3*4……..*N and factorial(0) = 1.
The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consist of one line. The first line of each test case consists of an integer N.
Corresponding to each test case, in a new line, print the number of digits that appear in its factorial.
1 ≤ T ≤ 100
1 ≤ N ≤ 104
Testcase 1: Factorial of 5 is 120. Number of digits in 120 is 3 (1, 2, and 0).
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.