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>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
const ll MOD = 1000000007;
const ll INF = 10000000000000;
#define all(v) v.begin(), v.end()

ll modPow(ll a, ll n) {
  if (n == 0) return 1; // 0乗にも対応する場合
  if (n == 1) return a % MOD;
  if (n % 2 == 1) return (a * modPow(a, n - 1)) % MOD;
  ll t = modPow(a, n / 2);
  return (t * t) % MOD;
}

int main(){
  ll K,ans=0,N;
  string S;
  cin >> K >> S;
  N=S.size();
  vector<ll> comb(K+1);
  comb.at(0)=1;
  rep(i,K){
    comb.at(i+1)=comb.at(i)*modPow(i+1,MOD-2);
    comb.at(i+1)%=MOD;
    comb.at(i+1)*=N-1+i+1;
    comb.at(i+1)%=MOD;
  }
  rep(i,K+1){
    ll x;
    x=modPow(26,K-i)*modPow(25,i);
    x%=MOD;
    x*=comb.at(i);
    ans+=x;
    ans%=MOD;
  }
  cout << ans << endl;
}