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 = 2000000 + 10;
const int MOD = 1000000007;

string s;
int p[N], pr[N];

int exp(int x, int n)
{
	int tmp;
	if (n == 0) return 1;
	tmp = exp(x, n / 2);
	tmp = 1LL * tmp * tmp % MOD;
	if (n % 2 == 1) tmp = 1LL * tmp * x % MOD;
	return tmp;
}

int cal(int n, int m)
{
	return 1LL * p[n] * pr[m] % MOD * pr[n-m] % MOD;
}

int main()
{
	int res, n, k, x, y, i;
	cin>>k;
	cin>>s;
	n = s.size();
	p[0] = 1;
	for (i=1; i<=k+n; i++) p[i] = 1LL * p[i-1] * i % MOD;
	pr[0] = 1;
	for (i=1; i<=k+n; i++) pr[i] = exp(p[i], MOD - 2);
	res = 0;
	for (i=0; i<=k; i++)
	{
		x = exp(26, i);
		y = exp(25, k - i);
		res = (res + 1LL * x * y % MOD * cal(k - i + n - 1, n - 1) % MOD) % MOD;
	}
	cout<<res<<endl;
	return 0;
}