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 <iostream>
#include <vector>
#include <string>
using namespace std;

const int mod=1000000007;

int revmod(int n){
  bool modbool[30] = {1,0,1,0,0,0,0,0,0,1,0,1,0,0,1,1,0,1,0,1,1,0,0,1,1,1,0,1,1,1};
  long ret=1, pow=n;
  for(bool b: modbool){
    if(b){
      ret *= pow;
      ret %= mod;
    }
    pow *= pow;
    pow %= mod;
  }
  return ret;
}

int main(){
  int k;
  string s;
  cin >> k >> s;
  vector<long>pow25(k+10, 1), pow26(k+10, 1);
  for(int i=1; i<k+10; i++){
    pow25[i] = (pow25[i-1]*25)%mod;
    pow26[i] = (pow26[i-1]*26)%mod;
  }
  int l = s.length();
  long C=1, ret=0;
  for(int x=0; x<=k; x++){
    ret += (C * ((pow25[x] * pow26[k-x])%mod))%mod;
    ret %= mod;
    C *= (long(x+l)*revmod(x+1))%mod;
    C %= mod;
  }
  cout << ret;
  return 0;
}
  