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 int long long

using namespace std;

const int MOD = 1e9 + 7;

const int MAXN = 2e6 + 100;

int qpow(int a, int b)
{
	int res = 1;
	while(b)
	{
		if(b&1)res = res*a%MOD;
		a = a*a%MOD;
		b /= 2;
	}
	return res;
}

int inv(int x)
{
	return qpow(x,MOD-2);
}

int fact[MAXN];

int comb(int n, int k)
{
	return fact[n]*inv(fact[n-k]*fact[k]%MOD)%MOD;
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    fact[0] = 1;
    for(int i = 1 ; i < MAXN ; i++)fact[i] = fact[i-1]*i%MOD;

    int K;
    string S;

    cin >> K >> S;

    int N = S.size();

    int tot = qpow(26,K+N);

    for(int i = 0 ; i < N ; i++)
    {
    	tot = (tot + MOD - comb(N+K,i)*qpow(25,N+K-i)%MOD)%MOD;
    }

    cout << tot << '\n';

    return 0;
}