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>
#define N 1000000
#define LL long long
using namespace std;

const LL mod=1e9+7;
int k;
LL fac[N*2+5],facinv[N*2+5];
char s[N+5];
LL ksm(LL x,LL y)
{
	LL res=1;
	while(y)
	{
		if(y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}
	return res;
}
LL C(int x,int y)
{
	return fac[x]*facinv[y]%mod*facinv[x-y]%mod;
}
int main()
{
	int i,j;
	scanf("%d",&k);
	scanf("%s",s+1);
	fac[0]=1;
	for(i=1;i<=(N<<1);i++)
		fac[i]=fac[i-1]*i%mod;
	facinv[N<<1]=ksm(fac[N<<1],mod-2);
	for(i=N*2-1;i>=0;i--)
		facinv[i]=facinv[i+1]*(i+1)%mod;
	int n=strlen(s+1);
	LL ans=0;
	for(i=0;i<=k;i++)
		ans+=ksm(25,i)*ksm(26,k-i)%mod*C(n+i-1,n-1)%mod;
	printf("%lld\n",ans%mod);
	return 0;
}