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 <cstdio>
#include <string>
#include <iostream>
using namespace std;
#define ll long long
ll mod = 1000000007;
ll big(ll b, ll p){
	if (p == 0) return 1;
	ll h = big(b, p / 2);
	ll r = h * h % mod;
	if (p % 2 == 1) r = r * b % mod;
	return r;
}
int main(){
	int n, m;
	string s;
	cin >> m >> s;
	n = s.size();
	ll ans = 0, c[m + 1];
	c[0] = 1;
	for (int i = 1; i <= m; i++) c[i] = (c[i - 1] * (n + i - 1) % mod) * big(i, mod - 2) % mod;
	for (int i = 0; i <= m; i++) (ans += c[i] * big(25, i) % mod * big(26, m - i) % mod) %= mod;
	printf("%lld\n", ans);
}