C++ Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\nlong long mod=1e9+7;\nlong long dp[100001][3][2][2];\nlong long f(int index,int n,int e,int l,int t){\n    if(index==n){\n        if(e>=2 && l>=1 && t>=1) return 1;\n        else return 0;\n    }\n    if(dp[index][e][l][t]!=-1) return dp[index][e][l][t];\n    long long pick=0;\n    for(int i=1;i<=26;i++){\n        if(i==5 && e<2){\n            pick=(pick+(f(index+1,n,e+1,l,t)%mod))%mod;\n        }\n        else if(i==12 && l<1){\n            pick=(pick+(f(index+1,n,e,l+1,t)%mod))%mod;\n        }\n        else if(i==20 && t<1){\n             pick=(pick+(f(index+1,n,e,l,t+1)%mod))%mod;\n        }\n        else  pick=(pick+(f(index+1,n,e,l,t)%mod))%mod;\n    }\n    return dp[index][e][l][t]=pick;\n}\n    int stringCount(int n) {\n        if(n<=3) return 0;\n        memset(dp,-1,sizeof(dp));\n        return (int)(f(0,n,0,0,0)%mod);\n    }\n};\n```
['C++']