Given an integer n, return the total number of strings of length n consisting only of lowercase English letters that can be rearranged to contain "leet" as a substring.

Since the result may be very large, return it modulo $10^9 + 7$.

Note: A substring is a contiguous non empty sequence of characters within a string.

Constraints:

• $1 \leq$ n $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.