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
R=int(input())
s=input()
k=len(s)
n=R+k
MOD=10**9+7
factorials=[1]
current=1
for i in range(1,n+1):
  current=(current*i)%MOD
  factorials.append(current)
inverses=[]
for i in range(n+1):
  inverses.append(pow(factorials[i],MOD-2,MOD))
ans=0
for i in range(R+1):
  ans=(ans+factorials[n]*inverses[i+k]*inverses[n-i-k]*pow(25,n-k-i,MOD))%MOD
print(ans)