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 mod 1000000007
#define MX 2000000
long long pw[2][1000005],fact[MX+5],inv[MX+5];
long long pow_log(long long x,int y)
{
	if (!y)
	return 1;
	long long ret=pow_log(x,y/2);
	ret=(ret*ret)%mod;
	if (y%2)
	ret=(ret*x)%mod;
	return ret;
}
long long ncr(int n,int r)
{
	return ((fact[n]*inv[r])%mod*inv[n-r])%mod;
}
int main()
{
	fact[0]=1;
	inv[0]=1;
	for (int i=1;i<=MX;i++)
	fact[i]=(i*fact[i-1])%mod;
	inv[MX]=pow_log(fact[MX],mod-2);
	for (int i=MX-1;i>=0;i--)
	inv[i]=(i+1)*inv[i+1]%mod;
	int k,ans=0;
	string s;
	cin >> k >> s;
	int n=s.size();
	pw[0][0]=1;
	pw[1][0]=1;
	for (int i=1;i<=k;i++)
	{
		for (int j=0;j<2;j++)
		pw[j][i]=((25LL+j)*pw[j][i-1])%mod;
	}
	for (int i=0;i<=k;i++)
	ans=(ans+pw[1][i]*pw[0][k-i]%mod*ncr(n+k-i-1,n-1))%mod;
	cout << ans;
}