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;
#define rep(i,x,y) for(int i=x;i<y;i++)
#define range(a) (a).begin(),(a).end()
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int siz=2e5;
const int inf=1e9;
long modpow(long x,int n){
	int i = 0;long res = 1;
	while(n >= (1<<i)){
		if(n & (1<<i)) (res *= x) %= mod;
		i++;
		x = (x * x) % mod;
	}return res;
}
int main(){
	int K; cin>>K;
	string s; cin>>s;
	int N = s.size();
	long ans = 0;
	long res = 1;
	long a = 1, b = modpow(26, K);
	rep(i,0,K+1){
		(ans += res * a % mod * b % mod) %= mod;
		(res *= modpow(i+1, mod-2) * (i + N) % mod) %= mod;
		(a *= 25) %= mod;
		(b *= modpow(26, mod-2)) %= mod;//cout<<ans<<endl;
	}cout<<ans<<endl;
}