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;
typedef long long ll;
#define rep(k,i,n) for(ll i=k;i<n;++i)
const ll mod=1e9+7;
static ll f[(ll)2e6];
ll mpow(ll x,ll n){
    ll ret=1;
    for(ll i=n;i;i>>=1){
        if(i&1)ret=ret*x%mod;
        x=x*x%mod;
    }
    return ret;
}
int main(void){
    ll n;
    string s;
    cin>>n>>s;
    ll m=s.size();
    f[0]=1;
    rep(1,i,n+m)f[i]=f[i-1]*i%mod;
    ll ans=0;
    rep(0,i,n+1){
        ll c=f[n+m-1-i]*mpow(f[m-1]*f[n-i]%mod,mod-2)%mod;
        ans=(ans+(c*mpow(26,i))%mod*mpow(25,n-i))%mod;
        //cout<<f[n+m-1-i]<<endl;
    }
    cout<<ans;
}