How many strings can be obtained by applying the following operation on a string S exactly K times: "choose one lowercase English letter and insert it somewhere"?

The answer can be enormous, so print it modulo (10^9+7).

Constraints

* K is an integer between 1 and 10^6 (inclusive).
* S is a string of length between 1 and 10^6 (inclusive) consisting of lowercase English letters.

Input

Input is given from Standard Input in the following format:


K
S


Output

Print the number of strings satisfying the condition, modulo (10^9+7).

Examples

Input

5
oof


Output

575111451


Input

37564
whydidyoudesertme


Output

318008117
#include<bits/stdc++.h>
#define LL long long
using namespace std;

const int P = 1e9+7;
const int MAXN = 2e6+10;

LL fac[MAXN];
LL invf[MAXN];

LL fp(LL a, int n){
    if(n==0)
        return 1;

    LL h = fp(a, n/2);
    h = h*h%P;
    if(n&1){
        h = h * a % P;
    }
    return h;
}

int main(){
    int n, len;
    string s;

    cin >>n>>s;
    len = s.length() + n;

    fac[0] = fac[1] = invf[0] = invf[1] = 1;
    for(int i=2;i<MAXN;i++){
        fac[i] = fac[i-1] * i % P;
        invf[i] = invf[i-1] * fp(i, P-2) % P;
    }

    LL ans = 0;
    for(int i=s.length();i<=len;i++){
        LL c = fac[i-1] * invf[s.length()-1] % P * invf[i-s.length()] % P;
        ans += c * fp(25, i-s.length()) % P * fp(26, len-i) % P;
        ans %=P;
    }

    cout << ans;

}
