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 maxn=1e5+5;
const long long inf=0x3f3f3f3f;
const long long mod=1e9+7;
long long quick_pow(long long a,long long b)
{
	return b?quick_pow(a*a%mod,b/2)*(b%2?a:1)%mod:1;
}
long long k;
string s;
long long fac[2<<20],inv[2<<20];
long long comb(long long x,long long y)
{
	return fac[x]*inv[y]%mod*inv[x-y]%mod;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	long long k;
	cin>>k>>s;
	long long t=k+s.size();
	fac[0]=1;
	for(long long i=1;i<=t;i++)
		fac[i]=fac[i-1]*i%mod;
	inv[t]=quick_pow(fac[t],mod-2);
	for(long long i=t;i--;)
		inv[i]=inv[i+1]*(i+1)%mod;
	long long ans=0;
	for(long long i=s.size();i<=k+s.size();i++)
		ans+=comb(t,i)*quick_pow(25,t-i)%mod;
	cout<<ans%mod<<endl;
	return 0;
}