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 rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
constexpr int MOD = 1e9+7, MX = 2e6+5;
int k, n, m;
char s[1000005];
ll e = 1, e2 = 1, iv[MX], ans;
ll exp(ll b, ll n){
	ll res = 1;
	for(; n; n/=2,(b*=b)%=MOD) if(n%2) (res *= b) %= MOD;
	return res;
}
int main(){
	scanf("%d\n%s", &k, s);
	n = strlen(s) + k;
	rep(i,n) (e *= i+1) %= MOD;
	iv[n] = exp(e, MOD-2);
	for(int i=n; i; i--) iv[i-1] = iv[i] * i % MOD;
	rep(i,k+1){
		ans += e * iv[n-i] % MOD * iv[i] % MOD * e2 % MOD;
		(e2 *= 25) %= MOD;
	}
	printf("%lld\n", ans % MOD);
}