Number of digits
Submissions: 1498   Accuracy:

16.39%

  Difficulty: Easy   Marks: 2

Given a number n, find the number of digits in the n’th Fibonacci Number.

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

Output:
Corresponding to each test case, in a new line, print the number of digits in n’th Fibonacci Numbers.

Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 1000

Example:

Input
2
5
12

Output
1
3

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

Author: rajatjha


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.