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;
typedef long long ll;
const ll mod = 1e9 + 7;
ll k;
char s[1000010];
ll fac[2000010], ifac[2000010], inv[2000010];
ll n;
ll ans;
ll ksm(ll a, ll b, ll m) {
	ll ret = 1;
	while (b) {
		if (b & 1) ret = (ret * a) % m;
		a = (a * a) % m;
		b >>= 1;
	}
	return ret;
}
ll C(ll i, ll j) {
	return fac[i] * ifac[j] % mod * ifac[i - j] % mod;
}
int main() {
	scanf("%lld", &k);
	scanf("%s", s + 1);
	n = strlen(s + 1);
	fac[0] = ifac[0] = inv[1] = 1;
	for (ll i = 2; i <= n + k; i++) {
		inv[i] = (mod - mod / i) * inv[mod % i] % mod;
	}
	for (ll i = 1; i <= n + k; i++) {
		fac[i] = fac[i - 1] * i % mod;
		ifac[i] = ifac[i - 1] * inv[i] % mod;
	}
	for (ll i = 0; i <= k; i++) {
		ans = (ans + ksm(26, i, mod) * C(n + k - i - 1, n - 1) % mod * ksm(25, k - i, mod)) % mod;
	}
	printf("%lld", ans);
	return 0;
}