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 <iostream>
#define ll long long
using namespace std;

const ll md = 1e9 + 7;
ll fact[2000001] = {}, res = 0;
int k, n; string s;

ll pw(ll b, ll e)
{
	ll t = 1;
	while (e)
	{
		if (e & 1) t = (t * b) % md;
		b = (b * b) % md; e >>= 1;
	}
	return t;
}

ll cb(ll n, ll r)
{
	return fact[n] * pw(fact[n - r], md - 2) % md * pw(fact[r], md - 2) % md;
}

int main()
{
    ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> k >> s; n = s.size();
	fact[0] = 1;
	for (int i = 1; i <= n + k; i++) {fact[i] = (fact[i - 1] * i) % md;}
	for (int i = n; i <= n + k; i++)
	{
		res = (res + pw(26, n + k - i) * pw(25, i - n) % md * cb(i - 1, n - 1) % md) % md;
	}
	cout << res << "\n";
	return 0;
}