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<cstdio>
#include<cstring>
using namespace std;
const int Mod=1e9+7;
int n,m,ans,fac[2100000],inv[2100000];
char s[2100000];
void init(int n){
    fac[0]=1; for (int i=1;i<=n;i++) fac[i]=1ll*fac[i-1]*i%Mod;
    inv[1]=1; for (int i=2;i<=n;i++) inv[i]=1ll*(Mod-Mod/i)*inv[Mod%i]%Mod;
    inv[0]=1; for (int i=1;i<=n;i++) inv[i]=1ll*inv[i-1]*inv[i]%Mod;
}
int qpow(int x,int a){
    int res=1;
    while (a){
        if (a&1) res=1ll*res*x%Mod;
        x=1ll*x*x%Mod; a>>=1;
    }
    return res;
}
int C(int n,int m){
    return 1ll*fac[n]*inv[m]%Mod*inv[n-m]%Mod;
}
int main() {
	scanf("%d",&n);
	scanf("%s",s); m=strlen(s);
	n+=m; init(n);
    for (int i=m;i<=n;i++)
		ans=(ans+1ll*qpow(25,i-m)*qpow(26,n-i)%Mod*C(i-1,m-1))%Mod;
    printf("%d\n",ans);
    return 0;
}