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 int maxn=2000004;
const int mod=1000000007,inf=1000000007;

std::string s;
inline long long powmod(long long a,long long b)
{
	long long res=1;
	while(b>0)
	{
		if(b&1) (res*=a)%=mod;
		(a*=a)%=mod,b>>=1;
	}
	return res;
}
long long fact[maxn],invfact[maxn];
inline void init()
{
	fact[0]=invfact[0]=1;
	for(int i=1;i<maxn;++i)
		fact[i]=fact[i-1]*i%mod,invfact[i]=powmod(fact[i],mod-2);
}
inline long long C(long long n,long long m) {return fact[n]*invfact[m]%mod*invfact[n-m]%mod;}
signed main(){
	int n;
	cin>>n>>s; 
	init();
	int len=s.length()-1;
	long long ans=0;
	for(int i=0;i<=n;++i)
		(ans+=powmod(26,i)*powmod(25,n-i)%mod*C(n-i+len,len))%=mod;
	cout<<ans;
	return 0;
}