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;
using ll = long long;
ll k, ans, mod=1e9+7, fac[2000005], inv[2000005], finv[2000005];
void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < 2000005; i++){
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = mod - inv[mod%i] * (mod / i) % mod;
		finv[i] = finv[i - 1] * inv[i] % mod;
	}
}
int main() {
	string s;
	cin >> k >> s;

	COMinit();

	function<ll(ll,ll)> mpow = [&](ll a, ll b) {
		return (b ? (b%2 ? mpow(a,b-1)*a%mod : mpow(a*a%mod,b/2)%mod) : 1);
	};
	
	auto com = [&](ll a, ll b) {
		return fac[a]*finv[b]%mod*finv[a-b]%mod;
	};

	for (int i = 0; i <= k; i++) {
		ll num = (mpow(26,i)*mpow(25,k-i)%mod * (com(s.size()+k-1-i,s.size()-1))%mod)%mod;
		ans = (ans + num) % mod;
	}
	cout << ans << endl;
}
