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 fi first
#define endl "\n"
#define se second
#define ll long long
#define inf 0x3f3f3f3f
#define fast    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int N = 2e6+5;
const ll mod =   1e9+7;
int k,n;ll ans;string s;
int fac[N],inv[N];
int po(int x , int y){
	int res=1;
	while(y){
		if(y&1)
		res=1ll*res*x%mod;
		y>>=1;
		x=1ll*x*x%mod;
	}
	return res%mod;
}
int ncr(int n,int r){
	if(r>n) return 0;
	return 1ll*fac[n]*inv[r]%mod*inv[n-r]%mod;
}
int main()
{  fast
   cin>>k>>s;
   fac[0]=1;
   for(int i=1;i<N;i++)
   fac[i]=1ll*i*fac[i-1]%mod;
   inv[N-1]=po(fac[N-1],mod-2);
   for(int i=N-2;i>=0;i--)
   inv[i]=1ll*(i+1)*(inv[i+1])%mod;
   n=s.size();
   for(int i=0;i<=k;i++){
   	ans=(ans+1ll*po(25,k-i)*po(26,i)%mod* ncr(n-1+k-i,n-1))%mod;
   }
   cout<<ans;
}