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;

typedef long long ll;
const ll M = 1e9 + 7;

ll n, m, ans = 0, fac[2000010];
string s;

ll mpow(ll a, ll n) {
    int ret = 1;
    for(ll i = n; i; i >>= 1, a = a * a % M)
        if(i & 1) ret = ret * a % M;
    return ret;
}

int main() {
    cin >> n >> s;
    m = s.size();
    fac[0] = 1;
    for(int i = 1; i < m + n; i++) fac[i] = (fac[i - 1] * i) % M;
    for(int i = 0; i <= n; i++) {
        ll c = (fac[m + n - i - 1] * mpow((fac[m - 1] * fac[n - i]) % M, M - 2)) % M;
        ans = (ans + (mpow(26, i) * c) % M * mpow(25, n - i)) % M;
    }
    cout << ans;
}
