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;

#define fi first
#define se second
#define SZ(x) (int)x.size()
#define ll long long
#define pb push_back
#define pq priority_queue
#define pii pair<int,int>
#define mod 1000000007
#define inf 0x3f3f3f3f
#define debug(x) cerr<<#x<<"="<<x<<'\n'
#define rep(i,a,b) for (int i=a;i<(b);i++)

const int maxn=3e6+10;

int n,m;
ll fac[maxn];

ll p0w(ll base,int p) {
	ll res=1;
	while (p) {
		if (p%2==1) res*=base,res%=mod;
		base=base*base%mod;
		p>>=1;
	}
	return res;
}

ll C(int x,int y) {
	return fac[x]*p0w(fac[x-y],mod-2)%mod*p0w(fac[y],mod-2)%mod;
}

int main(){
	std::ios::sync_with_stdio(false);
	fac[0]=1;
	rep(i,1,maxn) fac[i]=fac[i-1]*(ll)i%mod;
	cin>>n;
	string s;
	cin>>s;
	n+=SZ(s);
	int m=SZ(s);
	ll ans=0;
	for (int i=m;i<=n;i++) {
		ans+=C(i-1,m-1)*p0w(25,i-m)%mod*p0w(26,n-i)%mod;
		ans%=mod;
	}
	cout<<ans;
	return 0;
}
