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>

using namespace std;

const int MOD = 1000000007;

int fac[2000001], ifac[2000001], inv[2000001];

int main()
{
  int K, L;
  char s[1000001];
  
  scanf("%d", &K);
  scanf("%s", s);
  L = strlen(s);
  
  fac[0] = ifac[0] = 1;
  fac[1] = ifac[1] = 1;
  inv[1] = 1;
  for (int i = 2; i <= K + L; i++) {
    fac[i] = (long long)fac[i - 1] * i % MOD;
    inv[i] = MOD - (long long)inv[MOD % i] * (MOD / i) % MOD;
    ifac[i] = (long long)ifac[i - 1] * inv[i] % MOD;
  }

  int pow = 1;
  int ans = 0;
  for (int i = 0; i <= K; i++) {
    ans = ((long long)ans + (((long long)pow * fac[K + L]) % MOD) * (((long long)ifac[i] * ifac[K + L - i]) % MOD)) % MOD;
    pow = (long long)pow * 25 % MOD;
  }
  
  printf("%d\n", ans);
  
  return 0;
}