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
#pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
const int N=2e6+3;
const int mod=1e9+7;
int f[N];int inv[N];int len;
int modp(int a,int b)
{
	if(b==0)return 1;
	int u=modp(a,b/2);
	u=(u*u)%mod;
	if(b&1)return (a*u)%mod;
	return u;
}
int ncr(int n,int r)
{
	if(n<r)return 0;
	int res=(f[n]*inv[r])%mod;
	res*=inv[n-r];
	res%=mod;
	return res;
}
int p(int n)
{
	int res=modp(25,len-n);
	res*=ncr(len,n);
	return res%mod;
}
int32_t main()
{
	f[0]=1;inv[0]=modp(f[0],mod-2);
	for(int i=1;i<N;i++)
	{
		f[i]=(f[i-1]*i)%mod;
		inv[i]=modp(f[i],mod-2);
	}
	
	int n,k;
	cin>>k;
	string s;
	cin>>s;
	n=s.length();
	len=n+k;
	int base=modp(26,len);
	int sum=0;
	for(int i=0;i<n;i++)
	{
		sum+=p(i);
		sum%=mod;
	}
	cout<<(base-sum+mod)%mod;
	
}