Count Good Numbers

A digit string is good if the digits (0-indexed) at even indices are even and the digits at odd indices are prime (2, 3, 5, or 7).

Given an integer n, return the count of good numbers of length n. Since the answer may be very large, return it modulo 10^9 + 7.