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 <iostream>
#include <string>
#include <vector>
using namespace std;

//  a^b % m
long long powmod(long long a, long long b, long long m)
{
    long long r = 1;
    for (; b>0; b>>=1, a=a*a%m)
        if (b&1)
            r = r*a%m;
    return r;
}

int main()
{
    int K;
    cin>>K;
    string S;
    cin>>S;

    int N = (int)S.size();
    long long M = 1000000007;
    vector<long long> F(N+K+1);
    F[0] = 1;
    for (int i=1; i<=N+K; i++)
        F[i] = F[i-1]*i%M;

    auto C = [&](long long a, long long b)
    {
        return F[a]*powmod(F[b], M-2, M)%M*powmod(F[a-b], M-2, M)%M;
    };

    long long ans = 0;
    for (int i=N; i<=N+K; i++)
        ans += C(N+K, i)*powmod(25, N+K-i, M)%M,
        ans %= M;
    cout<<ans<<endl;
}
