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 Mod=1e9+7;
int k,fac[2000010],inv[2000010];
char S[1000010];
int ksm(int aa,int bb)
{
	int ans=1;
	for (;bb;bb>>=1) {
		if (bb&1) ans=1LL*ans*aa%Mod;
		aa=1LL*aa*aa%Mod;
	}
	return ans;
}
int C(int N,int M)
{
	if (N<0||M<0||N<M) return 0;
	return 1LL*fac[N]*inv[N-M]%Mod*inv[M]%Mod;
}
int main()
{
	scanf("%d",&k);
	scanf("%s",S+1);
	int n=strlen(S+1),ans=0;
	fac[0]=1;for (int i=1;i<=n+k;i++) fac[i]=1LL*fac[i-1]*i%Mod;
	inv[n+k]=ksm(fac[n+k],Mod-2);
	for (int i=n+k-1;i>=0;i--) inv[i]=1LL*inv[i+1]*(i+1)%Mod; 
	for (int i=n;i<=n+k;i++) {
		ans+=1LL*C(i-1,n-1)*ksm(25,i-n)%Mod*ksm(26,n+k-i)%Mod;
		ans%=Mod;
	}
	cout<<ans;
	return 0;
}