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>
typedef long long ll;
const int MOD = 1e9+7, MK=1e6+1, MS = 1e6+1;
int K, L;
ll ans, F[MK+MS], IF[MK+MS];
inline ll exp(ll b, ll e) {
    ll ret = 1;
    while(e) {
        if(e&1) ret = (ret * b) % MOD;
        b = (b * b) % MOD;
        e /= 2;
    }
    return ret;
}
inline ll nCr(int n, int r) {
    return (((F[n] * IF[r]) % MOD) * IF[n - r]) % MOD;
}
int main() {
    scanf("%d\n", &K);
    scanf("%*s%n", &L);
    F[0] = IF[0] = 1;
    for(int i=1;i<=K+L;++i) {
        F[i] = (F[i-1] * i) % MOD;
        IF[i] = (IF[i-1] * exp(i, MOD - 2)) % MOD;
    }
    for(int i=0;i<=K;++i) {
        ans = (ans + (((nCr(i + L - 1, L - 1) * exp(25, i)) % MOD) * exp(26, K - i)) % MOD) % MOD;
    }
    printf("%lld\n", ans);
}