Let f(n) be the n-th Fibonacci number, given by
Given the value of n, find f(1) + f(2) + ... + f(n).
f(1)
f(2)
f(n)
One positive integer n (n ≤ 1000).
Print the value of sum modulo 10^9 + 7.
10^9