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 = 2e6 + 5;
typedef long long LL;

LL mod = 1e9 + 7, ans;
string s;
int k, n;
LL fac[N], inv[N];

LL ksm(LL a, LL b) {
	LL res = 1;
	while(b) {
		if(b&1) res = res*a%mod;
		b /= 2;
		a = a*a%mod;
	}
	return res;
}

LL comb(int a, int b) {
	return fac[a]*inv[a - b]%mod*inv[b]%mod;
}

int main() {
	cin>>k>>s;
	n = s.size();
	fac[0] = inv[0] = 1ll;
	for(LL i = 1; i <= n + k; i++) {
		fac[i] = fac[i - 1]*i%mod;
		inv[i] = ksm(fac[i], mod - 2);
	}
	for(LL i = n; i <= n + k; i++) 
		ans = (ans + comb(i - 1, n - 1)*ksm(25, i - n)%mod*ksm(26, n + k - i)%mod)%mod;
	cout<<ans<<endl;

}