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 <string>
#include <vector>
using namespace std;

static const int mod = 1e9 + 7;

int fast_power(int a, int b) {
  long long p = 1, q = a;
  while (b) {
    if (b & 1) p = p * q % mod;
    q = q * q % mod;
    b >>= 1;
  }
  return p;
}

int main() {
  int k;
  scanf("%d", &k);
  string s;
  cin >> s;

  int n = s.length() + k;
  vector<int> g(n + 1, 1);
  for (int i = 1; i <= n; i++)
    g[i] = fast_power(i, mod - 2);

  long long c = 1;
  long long ans = fast_power(26, k);
  for (int i = 0; i < k; i++) {
    c = c * (static_cast<long long>(s.length()) + i) % mod * g[i + 1] % mod;
    ans = (ans + c * fast_power(25, i + 1) % mod * fast_power(26, k - i - 1) % mod) % mod;
  }

  printf("%lld\n", ans);

  return 0;
}