A Padovan Sequence is a sequence which is represented by the following recurrence
P(N) = P(N-2) + P(N-3)
P(0) = P(1) = P(2) = 1
Now given a number N your task is to find the Nth number in this sequence.
Note: Since the output could be very long take mod 1000000007
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each line contains an integer N.
For each test case, in a new line, print the nth no of the Padovan sequence.
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.