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<cstdio>
#include<algorithm>
#include<cstring>
#define ll long long
#define N 1000006
#define mod 1000000007
using namespace std;
int n, k;
char s[N];
ll p25[N], p26[N];
int pw(int x, int y){
	int sum=1;
	while(y){
		if(y&1) sum=(ll)sum*x%mod;
		x=(ll)x*x%mod;
		y>>=1;
	}
	return sum;
}
int main(){
    scanf("%d", &k);
    p25[0]=p26[0]=1;
    for(int i=1; i<=k; ++i) p25[i]=p25[i-1]*25%mod, p26[i]=p26[i-1]*26%mod;
    scanf("%s", s);
    n=strlen(s);
    ll ans=0, c=1;
    for(int i=0; i<=k; ++i){
    	if(i) c=c*(n-1+i)%mod*pw(i,mod-2)%mod;
    	ans=(ans+p26[k-i]*p25[i]%mod*c)%mod;
	} 
	printf("%lld",ans);
	return 0;
} 