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
class Cmb:
  g1=[1,1]
  g2=[1,1]
  inv=[0,1]
  def __init__(self,mod,upper_limit):
    self.mod=mod
    for i in range(2,upper_limit+1):
      Cmb.g1.append(Cmb.g1[-1]*i%mod)
      Cmb.inv.append(-Cmb.inv[mod%i]*(mod//i)%mod)
      Cmb.g2.append(Cmb.g2[-1]*Cmb.inv[-1]%mod)
  def cmb(self,n,r):
    if r<0 or n<r:
      return 0
    r=min(r,n-r)
    return Cmb.g1[n]*Cmb.g2[r]*Cmb.g2[n-r]%self.mod

k=int(input())
s=len(input())
mod=10**9+7
Cmb=Cmb(mod,k+s)
ans=1
for i in range(1,k+1):
  ans=(ans*26+Cmb.cmb(i+s-1,s-1)*pow(25,i,mod))%mod
print(ans)