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>
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;

long power(long x, long y, long mod){
  if(y==0)return 1;
  else if(y==1)return x;
  else if(y%2==0)return (power(x,y/2,mod)*power(x,y/2,mod))%mod;
  else return (((power(x,y/2,mod)*power(x,y/2,mod))%mod) *x)%mod;
}


int main(){
  string s;
  long k;
  cin >> k >> s;
  long mod = INF;
  long lens = int(s.size());
  long ans = 0;
  long comb = 1, tmp = lens;
  for(long i=0;i<=k;i++){
    ans += (((power(25,i,mod)*comb)%mod)*power(26,k-i,mod))%mod;
    ans %= mod;
    comb *= (tmp * power(i+1,mod-2,mod))%mod;
    comb %= mod;
    tmp++;
  }
  cout << ans << endl;
  return 0;
}
