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 pii pair<ll,ll>
using namespace std;
typedef long long ll;
const ll modd=1000000007;
ll n,k,fac[2000006];
string s;
ll qpow(ll a,ll b) {
	ll ans=1,base=a;
	while(b) {
		if(b&1) ans=ans*base%modd;
		b>>=1,base=base*base%modd;
	}
	return ans;
}

ll C(ll n,ll m) {
	return fac[n]*qpow(fac[m],modd-2)%modd*qpow(fac[n-m],modd-2)%modd;
}
void solve() {
	ll ans=0;
	for(int i=n; i<=n+k; i++)
		(ans+=C(i-1,n-1)*qpow(25,i-n)%modd*qpow(26,n+k-i)%modd)%=modd;
	cout<<ans;
}
void init() {
	n=s.size();
	fac[0]=1;
	for(ll i=1; i<=n+k; i++)
		fac[i]=fac[i-1]*i%modd;
}
int main() {
	cin>>k>>s;
	init();
	solve();
	return 0;
}