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
import sys
input = sys.stdin.readline
from collections import Counter

K = int(input())
S = input().rstrip('\n')

MOD = 10 ** 9 + 7

T = K + len(S)
fac = [1] * (T+1)
for i in range(1, T+1):
	fac[i] = fac[i-1] * i % MOD;

inv = [1] * (T+1)
inv[-1] = pow(fac[-1], MOD-2, MOD)
for i in range(T-1, -1, -1):
	inv[i] = inv[i+1] * (i+1) % MOD

def choose(n, k):
	return fac[n] * inv[n - k] % MOD * inv[k] % MOD

A = 1
l = len(S)
for i in range(K):
	A = A * 26 + pow(25, i+1, MOD) * choose(len(S)+i, i+1)
	A %= MOD

#A = pow(26, len(S)+K, MOD)
#A *= pow(56, MOD-2, MOD)
print(A%MOD)
