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 UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)

ULL K, N;
string S;
const ULL M = 1000000007;

const ULL Z = 2000000;
ULL F[Z + 1], I[Z + 1], iF[Z + 1];
ULL C(ULL n, ULL r) { return F[n] * iF[r] % M * iF[n - r] % M; }
ULL G[Z + 1];

int main() {
	F[0] = 1; I[1] = 1; iF[0] = 1;
	for (UL i = 1; i <= Z; i++) F[i] = F[i - 1] * i % M;
	for (UL i = 2; i <= Z; i++) I[i] = M - M / i * I[M % i] % M;
	for (UL i = 1; i <= Z; i++) iF[i] = iF[i - 1] * I[i] % M;

	cin >> K >> S;
	N = S.size();

	ULL ans = 0;
	ULL m = 1;
	rep(i, K) m = m * 26 % M;
	for (UL j = N; j <= N + K; j++) {
		ULL tmp = C(j - 1, N - 1);
		tmp = tmp * m % M;
		m = m * 25 % M * I[26] % M;
		ans += tmp;
	}

	ans %= M;
	cout << ans;

	return 0;
}
