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 long long mod = 1e9 + 7;
const int N = 2e6 + 5;
long long fac[N] = {};
long long inv(long long x) {
    if (x == 1) return 1;
    return (mod - mod / x) * inv(mod % x) % mod;
}
void init() {
    fac[0] = 1;
    for (long long i = 1; i < N; i++)
        fac[i] = fac[i - 1] * i % mod;
}
long long ksm(long long a, long long b) {
    if (b == 0) return 1;
    if (b & 1) return a * ksm(a * a % mod, b >> 1) % mod;
    return ksm(a * a % mod, b >> 1);
}
long long C(long long a, long long b) {
    return fac[a] * inv(fac[b] * fac[a - b] % mod) % mod;
}
int main() {
    string str;
    init();
    long long k, len;
    cin >> k >> str;
    len = str.size();
    long long ans = 0;
    for (long long i = len; i <= k + len; i++)
        ans = (ans + (C(i - 1, len - 1) * ksm(26, len + k - i) % mod) * ksm(25, i - len)) % mod;
    cout << ans << '\n';
    return 0;
}