INCLUSION EXCLUSION SOLUTION  100% BEATS
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 {\n    #define ll long long\n    const int mod=1e9+7;\n    private:\n    ll binary(ll a,ll b)\n    {\n        if(b==0) return 1;\n        ll res=binary(a,b/2);\n        if(b&1) //odd\n        {\n            return (a*((res)%mod*1LL*(res)%mod)%mod)%mod;\n        }\n        else\n        return ((res)%mod*1LL*(res)%mod)%mod;\n    }\npublic:\n    int stringCount(int n) \n    {\n        ll total=binary(26,n)%mod;\n        ll first=(75+n)*binary(25,n-1)%mod;\n        ll second=(2*n+72)*binary(24,n-1)%mod;\n        ll third=(n+23)*binary(23,n-1)%mod;\n\n        ll ans=(total-first+second-third+2*mod)%mod;\n        return ans;\n        \n    }\n};\n```
['C++']