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 <stdio.h>
#define mod 1000000007
typedef long long ll;

ll mul(ll a, ll b) {
  return a * b % mod;
}

ll rev(ll a) {
  ll ans = 1, b = mod - 2;
  while(b) {
    if(b & 1) ans = mul(ans, a);
    a = mul(a, a), b >>= 1;
  }
  return ans;
}
    

int main(void) {
  ll i, j, n, m, now = 1, c = 1, ans = 0, t = 1;
  scanf("%lld", &n);
  char s[1000010];
  scanf("%s", s);
  for(m = 0; s[m]; ++m);
  for(i = 0; i < n + 1; ++i) 
    ans += mul(now, c), ans %= mod, now = mul(now, 25), c = mul(c, mul(rev(i + 1), n + m - i));
  printf("%lld", ans);
  return 0;
}