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 ll long long
#define MOD 1000000007

using namespace std;

ll modinv(ll a, ll m = MOD) {
  ll b = m, u = 1, v = 0;
  while(b) {
    ll t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= m;
  if(u < 0) u += m;
  return u;
}

ll tf[2000000], ts[2000000], f[2000000];
int main() {
  tf[0] = ts[0] = f[0] = 1;
  for(int i = 1; i < 2000000; i++) {
    tf[i] = tf[i - 1] * 25 % MOD;
    ts[i] = ts[i - 1] * 26 % MOD;
    f[i] = f[i - 1] * i % MOD;
  }
  cin.tie(0);
  ios::sync_with_stdio(false);
  int k;
  string s;
  cin >> k >> s;
  int l = s.length();
  ll o = 0;
  for(int i = 1; i <= k + 1; i++) {
    ll c = f[k + l - i] * modinv(f[k - i + 1]) % MOD * modinv(f[l - 1]) % MOD;
    o = o + c * tf[k - i + 1] % MOD * ts[i - 1] % MOD;
    o %= MOD;
  }
  cout << o << '\n';
}