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;
#define int long long
const int mod=1000000007;
int fac[2000010],inv[2000010];
int qpow(int x,int y)
{
	int ans=1;
	for(;y;y>>=1,x=x*x%mod)
		if(y&1)
			ans=ans*x%mod;
	return ans;
}
int C(int x,int y)
{
	return fac[x]*inv[y]%mod*inv[x-y]%mod;
}
signed main()
{
	int k,i,ans=0;
	string s;
	cin>>k>>s;
	fac[0]=inv[0]=1;
	for(i=1;i<k+s.size()+5;i++)
	{
		fac[i]=fac[i-1]*i%mod;
		inv[i]=qpow(fac[i],mod-2);
	}
	for(i=0;i<=k;i++)
		ans=(ans+qpow(26,i)*qpow(25,k-i)%mod*C(k-i+s.size()-1,s.size()-1))%mod;
	cout<<ans;
	return 0;
}