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>

#define mod 1000000007

using namespace std;

int main() {
#ifdef orange
	freopen("input.txt", "r", stdin);
#endif
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int k;
	string s;
	cin >> k;
	cin >> s;
	long long pow26[k + 1], pow25[k + 1], inv[k + 2];

	pow25[0] = 1;
	pow26[0] = 1;
	for (int i = 1; i <= k; i++) {
		pow26[i] = (pow26[i - 1] * 26) % mod;
		pow25[i] = (pow25[i - 1] * 25) % mod;
	}

	long long ways = 0;
	long long choose = 1;
	int len = s.size();
	inv[1] = 1;
	for (int i = 2; i <= k + 1; i++) {
		inv[i] = (mod + (-(mod / i) * inv[mod % i]) % mod) % mod;
	}
	for (int first = k; first >= 0; first--) {
		//cout << choose << "\n";
		ways = (ways
				+ ((pow26[first] * pow25[(k - first)]) % mod * choose) % mod)
				% mod;
		choose = ((choose * ((k - first) + len)) % mod * inv[k - first + 1])
				% mod;
	}
	cout << ways << "\n";
}

