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 <stdio.h>
#include <string.h>
#define mod 1000000007
#define LL long long
#define maxn 1000010
char s[maxn];
LL fact[maxn<<1],inv[maxn<<1];
int m,n;
LL quick_pow(LL a,LL b){
	LL ret=1;
	while(b){
		if(b&1)ret=ret*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ret%mod;
}
void init(){
	int i;
	fact[0]=1;
	for(i=1;i<=n+m;i++)fact[i]=fact[i-1]*i%mod;
	inv[n+m]=quick_pow(fact[n+m],mod-2);
	for(i=n+m-1;i>=0;i--)inv[i]=inv[i+1]*(i+1)%mod;
}
LL C(int n,int m){
	return fact[n]*inv[n-m]%mod*inv[m]%mod;
}
int main(){
	int i;
	LL ans=0;
	scanf("%d%s",&n,s);
	m=strlen(s);
	init();
	for(i=0;i<=n;i++)
		ans=(ans+quick_pow(26,i)*C(n+m-i-1,m-1)%mod*quick_pow(25,n-i)%mod)%mod;
	printf("%lld\n",ans);
	return 0;
}