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 int long long
using namespace std;
constexpr int mod=1e9+7;
int fact[2000001];
int mypow(int x,int n){
    if(n==0)
        return 1;
    if(n%2==1)
        return mypow(x,n-1)*x%mod;
    int tmp=mypow(x,n/2);
    return tmp*tmp%mod;
}
int inv(int n){
    return mypow(n,mod-2);
}
int comb(int n,int k){
    return fact[n]*inv(fact[k]*fact[n-k]%mod)%mod;
}
signed main(){
    int k;
    string s;
    cin>>k>>s;
    fact[0]=1;
    for(int i=1;i<=k+s.size();i++)
        fact[i]=fact[i-1]*i%mod;
    int ans=0;
    for(int i=0;i<=k;i++)
        ans=(ans+comb(k+s.size(),i)*mypow(25,i))%mod;
    cout<<ans<<endl;
}