Malvika was getting bored of the usual Fibonacci problems, and decided to add a little twist to it. She defined a new function f() with the following properties:
She'll give an integer N, and you have to find out what f(N) is. Output the answers modulo 109+7.
Input: 2 10 17 3 23 17 3 Output: 7 1000000001
In the first test case, f(3) = 7, and so that is the output.
In the second test case, f(3) = -6 and the answer modulo 109+7 is 1000000001.