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 rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair

using namespace std;

const LL MOD=1e9+7;

LL t,pw25[2000010],pw26[2000010],fac[2000010],ans=0;
string s;

LL fastpow(LL x,LL a)
{
	LL res=x,ret=1;
	while(a>0)
	{
		if((a&1)==1) ret=ret*res%MOD;
		a>>=1;
		res=res*res%MOD;
	}
	return ret;
}
 
LL C(LL n,LL m)
{
	return fac[n]*fastpow(fac[m],MOD-2)%MOD*fastpow(fac[n-m],MOD-2)%MOD;
}

int main()
{
	pw25[0]=pw26[0]=fac[0]=1;
	repn(i,2000005)
	{
		pw25[i]=pw25[i-1]*25LL%MOD;
		pw26[i]=pw26[i-1]*26LL%MOD;
		fac[i]=fac[i-1]*(LL)i%MOD;
	}
	cin>>t>>s;
	rep(i,t+1) ans=(ans+pw26[i]*C(t-i+s.size()-1,s.size()-1)%MOD*pw25[t-i])%MOD;
	cout<<ans<<endl;
	return 0;
}