Given a positive integer N, find the Nth fibonacci number. Since the answer can be very large, print the answer modulo 1000000007.
The first line of input contains T denoting the number of testcases.Then each of the T lines contains a single positive integer N.
Output the Nth fibonacci number.
1 <= T <= 200
1 <= N <= 1000
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.