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>
#define ll long long
using namespace std;
const int N=2e6+5;
const int mod=1e9+7;
ll fac[N],inv[N],n;string s;
ll fastmi(ll a,ll b)
{
	if(b==0)return 1;
	ll res=fastmi(a,b/2);
	res=res*res%mod;
	if(b%2)res=res*a%mod;
	return res;
}
void init()
{
	fac[0]=1;
	for(int i=1;i<=2e6;i++)fac[i]=fac[i-1]*i%mod;
	inv[(int)2e6]=fastmi(fac[(int)2e6],mod-2);inv[0]=1;
	for(int i=2e6-1;i>=1;i--)inv[i]=inv[i+1]*(i+1)%mod;
	return;
}
ll C(ll x,ll y)
{
	return fac[x]*inv[x-y]%mod*inv[y]%mod;
}
ll ans;
int main()
{
	init();
	cin>>n>>s;
	for(int i=0;i<=n;i++)
	{
		ll res=0;
		res=fastmi(26,i)*C(n+s.size()-i-1,s.size()-1)%mod*fastmi(25,n-i)%mod;
		ans=(ans+res)%mod;
	}
	cout<<ans<<"\n";
	return 0;
}