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;
static const int64_t mod=1000000007;
int64_t f(int64_t x,int64_t y){
if(y==0)
  return 1;
  else if(y%2==0)
    return (f(x,y/2)*f(x,y/2))%mod;
  else
    return (x*((f(x,y/2)*f(x,y/2))%mod))%mod;
}
int main(){
  int64_t K; string s;
  cin>>K>>s;
  int64_t N=s.size();
  int64_t ans=0; int64_t a=1;int64_t b=f(25,K);
  int64_t c=1;
  for(int64_t i=1;i<=N-1;i++)
    c=(c*(((K+i)*f(i,mod-2))%mod))%mod;
  for(int64_t i=K;0<=i;i--){
  int64_t d=(a*((b*c)%mod))%mod;
    ans=(ans+d)%mod;
    a=(a*26)%mod;
    b=(b*f(25,mod-2))%mod;
    c=(c*((f(i+N-1,mod-2)*i)%mod))%mod;
  
  }cout<<ans<<endl;
  return 0;
}