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;
typedef long long ll;
const ll MOD=1e9+7;
int K,n;
string s;
ll mypow(int x,int t){
	ll ans=1,res=x;
	while(t){
		if(t&1)ans=ans*res%MOD;
		res=res*res%MOD,t>>=1;
	}
	return ans;
}
ll a[4000004],inv[4000004];
void init(){
	a[0]=1,inv[1]=1;
	for(int i=1;i<=4e6;i++)
		a[i]=a[i-1]*i%MOD;
	for(int i=2;i<=4e6;i++)
		inv[i]=(MOD-MOD/i)*inv[MOD%i]%MOD;
	inv[0]=1;
	for(int i=1;i<=4e6;i++)inv[i]=inv[i-1]*inv[i]%MOD;
}
ll C(int A,int B){
	return a[A+B]*inv[A]%MOD*inv[B]%MOD;
}
int main(){
	init();
	cin>>K>>s,n=s.size();
	ll ans=0;
	for(int i=0;i<=K;i++){
		ans+=C(n-1,i)*mypow(25,i)%MOD*mypow(26,K-i)%MOD;
		ans%=MOD;
	}
	cout<<ans;
}