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 int long long
const int N = 1e6 + 10, mod = 1e9 + 7;
int k, n, res, pa[N], pb[N], s[N << 1]; char ch[N];
int Pow (int x, int y) {
	int tmp = 1;
	while (y) {
		if (y & 1) tmp = tmp * x % mod;
		x = x * x % mod, y >>= 1;
	} return tmp;
}
int C (int x, int y) {
	return s[x] * Pow (s[y], mod - 2) % mod * Pow (s[x - y], mod - 2) % mod;
}
signed main() {
	scanf ("%lld %s", &k, ch + 1);
	pa[0] = pb[0] = s[0] = 1; n = strlen (ch + 1);
	for (int i = 1; i <= n + k; ++i) s[i] = s[i - 1] * i % mod;
	for (int i = 1; i <= k; ++i)
		pa[i] = pa[i - 1] * 25 % mod, pb[i] = pb[i - 1] * 26 % mod;
	for (int i = 0; i <= k; ++i) {
		res = (res + pb[k - i] * (C (i + n - 1, i) * pa[i] % mod) % mod) % mod;
	} return printf ("%lld\n", res), 0;
}