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 long long mod=1e9+7;
long long n,k,t,ans;
string s;
long long p25[2000010],p26[2000010];
inline long long power(long long a,long long b){
	long long ans=1;
	while(b){
		if(b%2)
			ans=ans*a%mod;
		b/=2;
		a=a*a%mod;
	}
	return ans;
}
int main(){
	p25[0]=p26[0]=1;
	cin>>k>>s;
	n=s.size();
	for(long long i=1;i<=n+k;i++){
		p25[i]=p25[i-1]*25%mod;
		p26[i]=p26[i-1]*26%mod;
	}
	t=1;
	for(long long i=n;i<=n+k;i++){
		ans=(ans+(t*p25[i-n]%mod)*p26[n+k-i])%mod;
		t=(t*i%mod)*power((i+1)-n,mod-2)%mod;
	}
	cout<<ans<<endl;
	return 0;
}