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 <iostream>
#include <vector>
#define N 2000005

using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll fac[N], rev[N];
ll fexp(ll x, ll y) {
  ll ans = 1;
  while (y) {
    if (y & 1)
      ans = ans * x % MOD;
    x = x * x % MOD;
    y >>= 1;
  }
  return ans;
}
ll C(ll n, ll k) {
  ll ans = fac[n] * rev[k] % MOD;
  ans = ans * rev[n - k] % MOD;
  return ans;
}
int main() {
  int k;
  string s;
  cin >> k >> s;
  int n = s.size();
  fac[0] = 1;
  rev[0] = 1;
  for (int i = 1; i <= n + k; ++i) {
    fac[i] = fac[i - 1] * i % MOD;
    rev[i] = fexp(fac[i], MOD - 2);
  }
  ll tot = fexp(26, n + k);
  ll bad = 0;
  for (int i = 0; i < n; ++i) {
    bad = (bad + fexp(25, n + k - i) * C(n + k, i) % MOD) % MOD;
  }
  tot = (tot - bad + MOD) % MOD;
  cout << tot;
}