Count Good Numbers

A digit string of length n is good if digits at even indices (0-based) are even and digits at odd indices are prime (2, 3, 5 or 7). Print the number of good strings of length n modulo 1,000,000,007.

1 <= n <= 10^15