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 ll = long long;
using namespace std;
const int N = 2e6 + 10;
const int mod = 1e9 + 7;

ll fac[N], inv[N];

ll binpow(ll a, ll b) {
	ll res = 1;
	while (b) {
		if (b & 1) res = res * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return res;
}

void init() {
	fac[0] = 1;
	for (int i = 1; i < N; i++) 
		fac[i] = fac[i - 1] * i % mod;
	inv[N - 1] = binpow(fac[N - 1], mod - 2);
	for (int i = N - 2; i >= 0; i--) 
		inv[i] = inv[i + 1] * (i + 1) % mod;
}

ll C(ll n, ll m) {
	return fac[n] * inv[m] % mod * inv[n - m] % mod;
}

int main() {
	init();
	int k; string s; cin >> k >> s;
	int n = k + s.size();
	ll ans = 0;
	for (int i = s.size(); i <= n; i++)
		ans += C(n, i) * binpow(25, n - i) % mod, ans %= mod;
	cout << ans << "\n";
}