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 md=1e9+7;
long long pw(long long x,long long y)
{
	long long ans=1;
	while(y)
	{
		if(y&1)
		{
			ans*=x;
			ans%=md;
		}
		x*=x;
		x%=md;
		y>>=1;
	}
	return ans;
}
long long ff[2020202],fff[2020202],n,ans=1;
string s;
long long C(long long x,long long y)
{
	return ff[x]*fff[x-y]%md*fff[y]%md;
}
int main()
{
	cin>>n>>s;
	ff[0]=1;
	for(int i=1;i<=2020000;i++)
	{
		ff[i]=ff[i-1]*i;
		ff[i]%=md;
	}
	fff[2020000]=pw(ff[2020000],md-2);
	for(int i=2019999;i>=1;i--)
	{
		fff[i]=fff[i+1]*(i+1);
		fff[i]%=md;
	}
	for(int i=s.size();i<=s.size()+n;i++)
	{
		ans+=C(s.size()+n,i)*pw(25,s.size()+n-i)%md;
		ans%=md;
	}
	cout<<ans<<endl;
	return 0;
}