Once upon a time there was a girl who loved to garden. This girl liked to work in the garden to plant peas, weed watermelon, and grown all sorts of tasty and interesting fruits and vegetables. In fact, not only did this girl have a green thumb, her whole hand was green!
On the first day of fall, the girl went into her garden to pluck some peas. There in front of her, merrily munching on some carrots, was ONE PAIR of bunnies Well, the bunnies were very cute, and the girl was very kind, so she let them be (A different kind of person may have shoo-ed them from the garden, but not this girl).
On the second day of fall, the girl went to her garden again. This time, low and behold, those baby bunnies had turned to full-sized adult rabbits! But… they were still cute, so she let that ONE PAIR alone. After all, what were a few cabbages? She didn’t mind if they ate some of the vegetables.
On the third day, the girl couldn’t wait to get out to her garden. This time, she was all set to prune the parsnip. She looked around for her rabbits, but instead of seeing just one pair of rabbits, there were now TWO PAIRS– an adult pair and a pair of babies. Hmmm…
The fourth day of fall was another lovely day, and so the girl went into her garden once again. “Oh my goodness!” she exclaimed. Not only were there the original adult rabbits, but the new bunnies had grown into adults and then the originals had had another set of baby bunnies. Now there were THREE PAIRS of rabbits and bunnies.
You kind of get the picture, right? The fifth day came along and there were FIVE PAIRS of rabbits and bunnies and so on, and so on, and so on.

If this pattern were to continue, how many rabbits and bunnies would soon be in this girl’s garden on Nth day?
Input : 
First line of input contains T, the number of test cases. 
In next T lines, each line will contain an integer N.

Output : 
Print the number of rabbits and bunnies in the girl's garden on Nth day.
Since the number can be very large, output it modulo 10^9+7.

Constraints : 
1 ≤ T ≤ 10^4
1 ≤ n ≤ 10^8

SAMPLE INPUT
2
5
13

SAMPLE OUTPUT
5
233

Explanation

In second case i.e. on 13th day there will 233 pairs of rabbits and bunnies.
You can check yourself.
fibs = {0: 0, 1: 1}
def fib(n):
    if n in fibs: return fibs[n]
    if n % 2 == 0:
        fibs[n] = (((2 * fib((n / 2) - 1)) + fib(n / 2)) * fib(n / 2))%1000000007
        return fibs[n]
    else:
        fibs[n] = ((fib((n - 1) / 2) ** 2) + (fib((n+1) / 2) ** 2))%1000000007
        return fibs[n]

for _ in xrange(input()):
	n=input()
	print fib(n)