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 <cstring>
#include <iostream>

using namespace std;

int mod = 1e9 + 7;

int n, m, ans, mi1[1000010], mi2[1000010], ny[1000010];
char s[1000010];

inline int ksm (int a, int p) { int ans = 1; for (; p; p >>= 1, a = 1ll * a * a % mod) if (p & 1) ans = 1ll * ans * a % mod; return ans; }

int main () {
	scanf ("%d%s", &n, s);
	m = strlen (s);
	mi1[0] = mi2[0] = 1;
	for (int i = 1; i <= 1000000; ++i) mi1[i] = 1ll * mi1[i - 1] * 25 % mod, mi2[i] = 1ll * mi2[i - 1] * 26 % mod;
	ny[1] = 1; for (int i = 2; i <= 1000000; ++i) ny[i] = 1ll * (mod - mod / i) * ny[mod % i] % mod;
	for (int i = m, c = 1; i <= n + m; ++i) {
		ans = (ans + 1ll * c * mi1[i - m] % mod * mi2[n + m - i] % mod) % mod;
		c = 1ll * c * i % mod * ny[i - m + 1] % mod;
	}
	printf ("%d\n", ans);
	return 0;
}