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;

// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()

// code starts
#define MOD 1000000007

ll pows(ll a, ll b)
{
  ll ans = 1;
  ll ks = a;
  ll left = b;
  while(left > 0)
  {
    if(left%2 == 1)
    {
      ans = ans*ks%MOD;
    }
    left /= 2;
    ks = ks*ks%MOD;
  }
  return ans;
}

ll mod_inv(ll a)
{
  return pows(a,MOD-2);
}

int main()
{
  ll k;
  cin >> k;
  string s;
  cin >> s;
  ll sl = s.size();
  ll i;
  ll ans = 0;
  ll sck = 1;
  for(i=0;i<=k;i++)
  {
    if(i > 0)
    {
      sck = sck*(sl+i-1)%MOD;
      sck = sck*mod_inv(i)%MOD;
    }
    ans += sck*pows(25,i)%MOD*pows(26,k-i)%MOD;
    ans %= MOD;
  }
  cout << ans << endl;
}
