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 long long mod=1e9+7;
long long Fact[2001000];
long long Fastmi(long long X,long long Exp)
{
	if(Exp==0)
		return 1ll;
	long long res=Fastmi(X*X%mod,Exp/2);
	if(Exp%2)
		res=res*X%mod;
	return res%mod;
}
long long NiYuan(long long X)
{
	return Fastmi(X,mod-2);
}
long long Div(long long A,long long B)
{
	return A*NiYuan(B)%mod;
}
long long C(long long N,long long K)
{
	return Div(Div(Fact[N],Fact[K]),Fact[N-K]);
}
void init()
{
	Fact[0]=1ll;
	for(int i=1;i<2001000;i++)
		Fact[i]=Fact[i-1]*i%mod;
	return ;
}
int main()
{
	init();
  long long K;
  cin>>K;
  string S;
  cin>>S;
  long long L=S.length();
  long long Ans=0;
  for(int i=0;i<=K;i++)
  {
  	long long Le=K-i;
  	long long res=C(Le+L-1,L-1);
  	res=res*Fastmi(25ll,Le)%mod;
  	res=res*Fastmi(26ll,(long long)(i))%mod;
  	Ans=(Ans+res)%mod;
  }
  cout<<Ans<<endl;
  return 0;
}