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<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=2002020,mod=1e9+7;
int n,m,fac[N],iv[N]; char s[N];
int read(){
	int x=0,f=1; char ch=getchar();
	while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int fpow(int x,int y){
	int res=1;
	for(;y;y>>=1,x=1ll*x*x%mod)
		if(y&1)res=1ll*x*res%mod;
	return res;
}
int C(int n,int m){
	return 1ll*fac[n]*iv[m]%mod*iv[n-m]%mod;
}
int main()
{
	n=read();
	scanf("%s",s+1); m=strlen(s+1);
	fac[0]=iv[0]=1;
	for(int i=1;i<=n+m;i++)
		fac[i]=1ll*fac[i-1]*i%mod,iv[i]=fpow(fac[i],mod-2);
	int ans=0;
	for(int i=0;i<=n;i++)
		ans=(ans+1ll*C(m+n-i-1,m-1)*fpow(26,i)%mod*fpow(25,n-i)%mod)%mod;
	cout<<(ans%mod+mod)%mod<<endl;
	return 0;
}