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;
int k,n,l;
long long res,MOD=1000000007,p25[2000100],comb;
long long inv[2000100];
void init_math(int N){
	inv[1]=1LL;
	for(int i=2;i<=N;i++) inv[i]=(MOD-((MOD/i)*inv[MOD%i])%MOD);
}
string s;
int main(){
	cin>>k>>s;
	n=s.size()+k;
	l=s.size();
	init_math(n);
	p25[0]=1;
	for(int x=1;x<=n;x++) p25[x]=(p25[x-1]*25LL)%MOD;
	comb=1;
	for(int x=1;x<=n;x++){
		comb=(comb*(long long)(n-x+1))%MOD;
		comb=(comb*inv[x])%MOD;
		if(x>=l) res=(res+comb*p25[n-x]%MOD)%MOD;
	}
	cout<<res<<endl;
	return 0;
}
