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 int long long

using namespace std;

const int N = 2e6 + 5, md = 1e9 + 7;
int fac[N], ifac[N];

int power(int x, int p) {
  int res = 1;
  while (p > 0) {
    if (p & 1) {
      (res *= x) %= md;
    }
    (x *= x) %= md;
    p >>= 1;
  }
  return res;
}

void precalc() {
  fac[0] = 1;
  for (int i = 1; i < N; i++) {
    fac[i] = fac[i - 1] * i % md;
  }
  ifac[N - 1] = power(fac[N - 1], md - 2);
  for (int i = N - 2; ~i; i--) {
    ifac[i] = ifac[i + 1] * (i + 1) % md;
  }
}

int C(int n, int k) {
  return fac[n] * ifac[k] % md * ifac[n - k] % md;
}

signed main() {
  int k;
  string s;
  cin >> k >> s;
  precalc();
  int n = s.size();
  int res = power(26, n + k);
  for (int i = 0; i < n; i++) {
    res += md - C(n + k, i) * power(25, n + k - i) % md;
    res %= md;
  }
  cout << res << '\n';
  return 0;
}
