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
K = int(input())
S = input()
L = len(S)
MOD = 10 ** 9 + 7

factorials = [1]
fact_invs = [1]
for i in range(1, L+K+1):
    factorials.append((factorials[-1]*i) % MOD)
    fact_invs.append(pow(factorials[-1], MOD-2, MOD))

ans = 1
for i in range(K):
    b = L + i
    a = L - 1
    nans = factorials[b]
    nans *= fact_invs[a]
    nans %= MOD
    nans *= fact_invs[b-a]
    nans %= MOD
    nans *= pow(25, b-a, MOD)
    nans %= MOD
    nans += ans * 26
    nans %= MOD
    ans = nans
print(ans)
