Given an integer n, your task is to count how many strings of length n can be formed under the following rules:

Each character is a lower case vowel ('a', 'e', 'i', 'o', 'u')
Each vowel 'a' may only be followed by an 'e'.
Each vowel 'e' may only be followed by an 'a' or an 'i'.
Each vowel 'i' may not be followed by another 'i'.
Each vowel 'o' may only be followed by an 'i' or a 'u'.
Each vowel 'u' may only be followed by an 'a'.

Since the answer may be too large, return it modulo 10^9 + 7.
 
Example 1:
Input: n = 1
Output: 5
Explanation: All possible strings are: "a", "e", "i" , "o" and "u".

Example 2:
Input: n = 2
Output: 10
Explanation: All possible strings are: "ae", "ea", "ei", "ia", "ie", "io", "iu", "oi", "ou" and "ua".

Example 3: 
Input: n = 5
Output: 68
 
Constraints:

1 <= n <= 2 * 10^4

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "class Solution:\n    def countVowelPermutation(self, n: int) -> int:\n        vowels_idx = {'a' : 0, 'e' : 1, 'i' : 2, 'o' : 3, 'u' : 4}\n        f = [None] * n\n        # We can safely assume a string can end in any vowel\n        f[n-1] = [1] * len(vowels_idx)\n        for i in range(n-2, -1, -1):\n            f[i] = [0] * len(vowels_idx)\n            for vowel in vowels_idx:\n                # If we have some vowel at current index i, then we know it can only\n                # be followed by a specific set of vowels, depending on the vowel at i\n                if vowel == 'a':\n                    f[i][vowels_idx[vowel]] += f[i+1][vowels_idx['e']]\n                elif vowel == 'e':\n                    f[i][vowels_idx[vowel]] += f[i+1][vowels_idx['a']] + f[i+1][vowels_idx['i']]\n                elif vowel == 'i':\n                    f[i][vowels_idx[vowel]] += f[i+1][vowels_idx['a']] + f[i+1][vowels_idx['e']] + f[i+1][vowels_idx['o']] + f[i+1][vowels_idx['u']]\n                elif vowel == 'o':\n                    f[i][vowels_idx[vowel]] += f[i+1][vowels_idx['i']] + f[i+1][vowels_idx['u']]\n                else:\n                    f[i][vowels_idx[vowel]] += f[i+1][vowels_idx['a']]\n                f[i][vowels_idx[vowel]] %= (10**9 + 7)\n        total = 0\n        for vowel in vowels_idx:\n            total += f[0][vowels_idx[vowel]]\n        return total % (10**9 + 7)\n            \n        memo = {}\n        def f(i, prev_vowel):\n            if i == n:\n                return 1\n            \n            if (i, prev_vowel) in memo:\n                return memo[(i, prev_vowel)]\n            \n            cnt = 0\n            if prev_vowel == 'a':\n                cnt += f(i + 1, 'e')\n            elif prev_vowel == 'e':\n                cnt += f(i + 1, 'a') + f(i + 1, 'i')\n            elif prev_vowel == 'i':\n                cnt += f(i + 1, 'a') + f(i + 1, 'e') + f(i + 1, 'o') + f(i + 1, 'u')\n            elif prev_vowel == 'o':\n                cnt += f(i + 1, 'i') + f(i + 1, 'u')\n            else:\n                cnt += f(i + 1, 'a')\n                \n            memo[(i, prev_vowel)] = cnt % (10**9 + 7)\n            return cnt\n        \n        cnt = 0\n        for vowel in ['a', 'e', 'i', 'o', 'u']:\n            cnt += f(1, vowel)\n        \n        return cnt % (10**9 + 7)\n\n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'countVowelPermutation'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6666