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;
#define LL long long
int N,K;
char s[2000010];
const int MOD = 1e9 + 7;
LL pw[2000010],fac[2000010],pw1[2000010];
LL qpow(LL x,LL y){
    LL re = 1;
    for (; y; y>>=1,x=x*x%MOD)
        if (y&1) re=re*x%MOD;
    return re;
}
LL C(LL n,LL m){
	return fac[n]*qpow(fac[m],MOD-2)%MOD*qpow(fac[n-m],MOD-2)%MOD;
}
int main(){
    scanf("%d%s",&K,s+1);
    N = strlen(s+1);
    fac[0] = 1;
    pw[0] = 1;
    pw1[0] = 1;
    for (int i=1; i<=2000000; i++) {
        fac[i] = fac[i-1]*i%MOD;
        pw[i] = pw[i-1]*26%MOD;
    	pw1[i] = pw1[i-1]*25%MOD;
	}
	LL ans = 0;
	for (int i=N; i<=N+K; i++){
		ans += pw[N+K-i] * C(i-1,N-1)%MOD * pw1[i-N]%MOD;
		ans %= MOD;
	} 
	printf("%lld\n",ans);
    return 0;
}