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 int maxn = 1<<22, mod = 1e9 + 7;
int fact[maxn], inv[maxn];
void pre() {
	for(int i = 0; i < maxn; i++)
		if(i < 2) fact[i] = inv[i] = 1;
		else fact[i] = i, inv[i] = mod - (mod/i)*1ll*inv[mod%i]%mod;
	for(int i = 1; i < maxn; i++)
		fact[i] = fact[i]*1ll*fact[i-1]%mod,
		inv[i] = inv[i]*1ll*inv[i-1]%mod;
}
int bp(int a, int p) {
	int r = 1;
	while(p) {
		if(p&1) r = r*1ll*a%mod;
		a = a*1ll*a%mod, p>>=1;
	}
	return r;
}
int nck(int i, int j) {
	if(i < j || j < 0) return 0;
	int t = fact[i]*1ll*inv[j]%mod;
	return t*1ll*inv[i-j]%mod;
}
int get(int i, int j) {
	int t = bp(25, i-j);
	return t*1ll*nck(i, j)%mod;
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	pre();
	int ans = 0, n, k;
	string s;
	cin >> k >> s;
	n = s.size();
	for(int i = n; i <= n+k; i++) ans = (ans + get(n+k, i))%mod;
	cout << ans;
	return 0;
}
//cacyaa
//128 + 2 + 128*
