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)
using namespace std;
long gyaku(long a, long mod){
  long long s = 1, tmp = a, t = mod - 2;
  while(t > 0){
    if(t % 2 == 1){
      s *= tmp;
      s %= mod;
    }
    t /= 2;
    tmp *= tmp;
    tmp %= mod;
  }
  return s;
}
int main(){
  int n, k; string s; cin >> k >> s; n = s.size();
  long a = 0, b = 1e9+7;
  vector<long> v(k+1, 1), u(k+1, 1), w(n+k+1, 1), x(n+k+1, 1);
  rep(i, n+k){
    w[i+1] = w[i] * (i+1); w[i+1] %= b;
    x[i+1] = x[i] * gyaku(i+1, b); x[i+1] %= b;
  }
  rep(i, k){
    v[i+1] = v[i] * 26; v[i+1] %= b;
    u[i+1] = u[i] * 25; u[i+1] %= b;
  }
  rep(i, k+1){
    long t = v[i] * u[k-i] % b;
    t *= w[n+k-i-1]; t %= b;
    t *= x[k-i]; t %= b;
    t *= x[n-1]; t %= b;
    a += t;
    a %= b;
  }
  cout << a << "\n";
  return 0;
}