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>
#define int long long
using namespace std;
const int mod=1e9+7;

int n,k,ans=0;
int jc[2000005];

int quick_power(int a,int b)
{
	int res=1;
	for (;b;b=b>>1,a=(a*a)%mod)
	{
		if (b&1)  res=(res*a)%mod;
	}
	return res;
}

inline int ny(int k)
{
	return quick_power(k,mod-2);
}

inline int C(int n,int m)
{
	return ((jc[n]*ny(jc[m]))%mod*ny(jc[n-m]))%mod;
}

inline void init()
{
	jc[0]=1;
	for (int i=1;i<=2000000;i++)  jc[i]=(jc[i-1]*i)%mod;
}

signed main()
{
	init();
	string s;
	cin>>k>>s;
	n=s.size();
	
	for (int i=0;i<=k;i++)  ans=(ans+((quick_power(26,i)*quick_power(25,k-i))%mod*C(k-i+n-1,n-1))%mod)%mod;
	cout<<ans<<endl;
	
	return 0;
}