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 rep(i, n) for (int i = 0; i < n; i++)
using namespace std;

typedef long long ll;

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    ll K, S, MOD = 1e9 + 7, ans = 0;
    string s;
    cin >> K >> s;
    S = s.size();
    //cout << "S=" << S << "\n";
    vector<ll> f(2000001, 1);
    rep(i, 2000000) f[i + 1] = (f[i] * (i + 1)) % MOD;
    rep(i, K + 1) {
        ll C = f[S + i - 1] * mod_pow(f[S - 1], MOD - 2, MOD);
        C %= MOD;
        C *= mod_pow(f[i], MOD - 2, MOD);
        C %= MOD;
        C *= mod_pow(25, i, MOD);
        C %= MOD;
        C *= mod_pow(26, K - i, MOD);
        C %= MOD;
        ans = (ans + C) % MOD;
        //cout << "ans=" << ans << "\n";
    }
    cout << ans << "\n";
}