Bunty is trying to solve a problem and he is unable to do it so he asks you to solve his problem.

Let $F(n)$ is the number of subsets of $(1,2,3....n)$ that contain no consecutive integers modulo $1000000007$.

Now you have to report $G(F(100000007))$;

$G(n)$ = number of binary sequences of length n that have no consecutive $0's$ modulo $1000000007$.