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>

const long long mod = 1000000007;
long long inv[2001001]={0,1}, fact[2001001]={1,1}, ifact[2001001]={1,1};
char s[1001001];

int main()
{
  for (int i=2;i<2001001;i++){
inv[i] = (mod -mod / i) * inv[mod % i] % mod;
    fact[i] = fact[i-1] * i % mod;
    ifact[i] = ifact[i-1] * inv[i] % mod;
  }
  
  int k; scanf ("%d %s",&k,s);
  int n = 0; while (s[n]) n++;
  
  long long full = 1, ans = 0;
  for (int i=0;i<k;i++) full = full * 26 % mod;
  for (int i=0;i<=k;i++){
    long long coeff = fact[i+n-1] * ifact[i] % mod * ifact[n-1] % mod;
    ans = (ans + coeff * full) % mod;
    full = full * 25 % mod;
full = full * inv[26] % mod;
  }
  printf ("%lld\n",ans);
	return 0;
}