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 int maxn = 2e6+10, mod = 1e9+7;
typedef long long ll;
ll fact[maxn], inv[maxn];
ll exp(ll a, ll b){
    ll res = 1LL;
    for(; b; b>>=1, a = (a*a)%mod) if(b&1) res = (res * a)%mod;
    return res;
}
void precalc(){
    fact[0] = 1LL;
    for(int i=1; i<maxn; i++) fact[i] = (fact[i-1] * i)%mod;
    inv[maxn-1] = exp(fact[maxn-1], mod - 2);
    for(int i=maxn-2; i>=0; i--) inv[i] = (inv[i+1] * (i+1))%mod;
}
ll ncr(ll n, ll r){
    if(n < r) return 0LL;
    return ((fact[n] * inv[n-r])%mod * inv[r])%mod;
}
int main(){
    precalc();
    ll k;
    cin >> k;
    string s;
    cin >> s;
    ll n = (int)s.size();
    ll l = n + k;
    ll ans = 0LL;
    for(ll i=n; i<=l; i++) ans = (ans + ((ncr(i - 1, n - 1) * exp(25, i - n))%mod * exp(26, l - i))%mod)%mod;
    cout << ans << "\n";
}
