Vaibhav is participating in MCA PCIC - largest international Math competition where he gets this problem:

Given $N$ equations of the form:

$a_{i}*(x_{i})^2 + b_{i}*(x_{i}) +c_{i}=0$, $i$ varies from $1$ to $N$,

where $a_{i} = b_{i} = i^{th}$ fibonacci number and $c_{i} = (i+2)^{th}$ fibonacci number.

Let $g_{i}=(-1)*(2*a_{i}*x_{i} + b_{i})^2$ for all the equations.

$h(N)= \sum_{i=1}^N g_{i}$

Submit $h(N) \mod (10^9+7)$ for $N=987654321342198766$.

Note: Fibonacci series:
$Fib[0]=0, Fib[1]=1, Fib[i] = Fib[i-1]+Fib[i-2]$

Now Vaibhav doesn't like maths, so you have to solve it for him.