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;

const int N=4000005;
const long long MOD=1e9+7;
int n,k;
long long f[N],inv[N],p[N],ans=1;
char ch[N];

long long ksm(long long a,long long b)
{
	long long res=1;
	while(b)
	{
		if(b%2) res=res*a%MOD;
		a=a*a%MOD,b/=2;
	}
	return res;
}

int main()
{
	scanf("%d%s",&n,ch),f[0]=p[0]=1;
	k=strlen(ch),n+=k;
	for(int i=1;i<=n;i++) f[i]=f[i-1]*i%MOD;
	inv[n]=ksm(f[n],MOD-2);
//	cout<<inv[n]*f[n]%MOD<<endl;
	for(int i=n;i>=1;i--) inv[i-1]=inv[i]*i%MOD;
	for(int i=1;i<=n;i++) p[i]=p[i-1]*25%MOD,ans=ans*26%MOD;
	for(int i=0;i<k;i++)
	{
		ans=(ans-f[n]*inv[i]%MOD*inv[n-i]%MOD*p[n-i]%MOD+MOD)%MOD;
//		cout<<i<<' '<<f[n]*inv[i]%MOD*inv[n-i]%MOD<<' '<<inv[i]<<' '<<inv[i]*f[i]%MOD<<endl;
	}
	printf("%lld\n",ans);
}