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>

using namespace::std;
#define int long long int
#define MOD 1000000007

int fact[2000005];

int pw(int b,int e){
	if(!e) return 1;
	int t=pw(b,e/2);
	t=(t*t)%MOD;
	if(e&1) t=(t*b)%MOD;
	return t;
}

int32_t main(){
	int k;
	cin>>k;
	string s;
	cin>>s;
	int n=s.length();
	int ans=pw(26,n+k);
	// cout<<ans<<'\n';
	fact[0]=1;
	for(int i=1;i<=2000000;i++)
		fact[i]=(fact[i-1]*i)%MOD;
	for(int i=0;i<n;i++)
		ans=(ans-((((((fact[n+k]*pw(fact[i],MOD-2))%MOD)*pw(fact[n+k-i],MOD-2))%MOD)*pw(25,n+k-i))%MOD)+MOD)%MOD;//,cout<<i<<' '<<((((((fact[n+k]*pw(fact[i],MOD-2))%MOD)*pw(fact[n+k-i],MOD-2))%MOD)*pw(25,n+k-i))%MOD)<<'\n';
	cout<<ans<<'\n';
}