Alice is fond of functions. Bob is jealous of her and challenges if she can solve the given function. F(N) = count of all unique possible sums made using at most two numbers from 1 to F(N-1), given F(1)=2. Alice gets confused and needs your help. Given N, you need to find out F(N) mod 1e9+7.

Please provide solution.