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 ll long long
#define all(V) V.begin(),V.end()
const ll MOD = 1000000007;

ll F[2000010], I[2000010];

ll modpow(ll x, ll y) {
	ll ans = 1;
	while (y) {
		if (y & 1) {
			ans = ans * x % MOD;
		}
		x = x * x % MOD;
		y /= 2;
	}
	return ans;
}

ll nCr(int n, int r) {
	return F[n] * I[n - r] % MOD * I[r] % MOD;
}

int main() {
	F[0] = I[0] = 1;
	for (ll i = 1;i < 2000010;i++) {
		F[i] = F[i - 1] * i % MOD;
		I[i] = modpow(F[i], MOD - 2);
	}
	int K, ss;
	cin >> K;
	string S;
	cin >> S;
	ss = S.size();
	ll ans = 0;
	for (int i = 0;i <= K;i++) {
		ans += nCr(ss - 1 + K - i, ss - 1) * modpow(25, K - i) % MOD * modpow(26, i) % MOD;
	}
	ans %= MOD;
	cout << ans << endl;
}
