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;

const int N=2000005;
const long long int mod=1e9+7;
long long int f[N],inv[N],p[N],q[N],ans=0;

long long int modpow(long long int x, long long int n){
    long res=1;
    for(; n>0; n>>=1) {
        if (n&1) res=res*x%mod;
        x=x*x%mod;
    }
    return res;
}

int main(){
    int k;
    cin >> k;
    string s;
    cin >> s;
    int n=s.length();
	f[0]=p[0]=q[0]=1;
	for(int i=1;i<=n+k;i++) f[i]=f[i-1]*i%mod;
	inv[n+k]=modpow(f[n+k],mod-2);//逆元はmod-2乗すればいいことが知られている
	for(int i=n+k;i>=1;i--) inv[i-1]=inv[i]*i%mod;
	for(int i=1;i<=k;i++) p[i]=p[i-1]*25%mod,q[i]=q[i-1]*26%mod;
	for(int i=0;i<=k;i++){
		ans += p[k-i]*q[i]%mod*f[n+k-i-1]%mod*inv[n-1]%mod*inv[k-i]%mod;
        ans %=mod;
	}
	cout << ans << endl;
}