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;
const long long MOD=1e9+7;
long long fanc[2000009], inv_fanc[2000009];

long long modpow(long long a, long long n, long long mod){
  long long ret = 1;
  while(n>0){
    if(n&1)ret = ret * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return ret;
}

long long modinv(long long a, long long mod){
  return modpow(a, mod-2, mod);
}

int main(){
  int k;
  string s;
  cin >> k >> s;

  fanc[0]=1;
  inv_fanc[0]=1;
  for(int i=1;i<=2000009;i++){
    fanc[i] = (fanc[i-1]*i)%MOD;
    inv_fanc[i] = modinv(fanc[i], MOD);
  }
  long long ans=0;
  long long n=s.length();
  for(int i=n-1;i<k+n;i++){
    long long add=modpow(25, i-(n-1), MOD);
    add = (add * fanc[i]) %MOD;
    add = (add * inv_fanc[i-(n-1)])%MOD;
    add = (add * inv_fanc[(n-1)])%MOD;
    add = (add * modpow(26, k+n-(i+1), MOD))%MOD;
    ans = (ans + add) %MOD;
  }
  cout << ans << endl;
}
