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>
using namespace std;
typedef long long ll;
const int MAXN = 2e7+1;
const int MOD = 1000000007;
int K,S;
ll fac[MAXN],ifac[MAXN],inv[MAXN];
ll wfac[MAXN];
ll bio(int n,int m){
    return ((fac[n]*ifac[m])%MOD*ifac[n-m])%MOD;
}
char str[MAXN];
int main(){
    cin >> K;
    scanf("%s",str+1);
    S = strlen(str+1);
    ll ans = 1;
    for(int i=1;i<=K+S;i++){ans = (ans * 26)%MOD;}
    wfac[0]=fac[0]=ifac[1]=ifac[0]=inv[0]=inv[1]=1;
    for(int i=1;i<=K+S;i++){
        wfac[i] = (wfac[i-1]*25)%MOD;
        fac[i] = (fac[i-1] * i)%MOD;

    }
    for(int i=2;i<=K+S;i++){
        inv[i] = ((MOD-MOD/i)*inv[MOD%i])%MOD;
        ifac[i] = (ifac[i-1]*inv[i])%MOD;
    }
    for(int i=0;i<S;i++){
        ans -= (bio(K+S,i)*wfac[K+S-i])%MOD;
        ans %= MOD;
        ans = (ans + MOD)%MOD;
    }
    cout << ans;
    return 0;
}