Codeforces520C-DNA Alignment

DNA Alignment

Vasya became interested in bioinformatics. He's going to write an article about similar cyclic DNA sequences, so he invented a new method for determining the similarity of cyclic sequences.

Let's assume that strings s and t have the same length n, then the function h(s, t) is defined as the number of positions in which the respective symbols of s and t are the same. Function h(s, t) can be used to define the function of Vasya distance ρ(s, t):

where   is obtained from string  s, by applying left circular shift  i times. For example, ρ("AGC", "CGT") =  h("AGC", "CGT") + h("AGC", "GTC") + h("AGC", "TCG") +  h("GCA", "CGT") + h("GCA", "GTC") + h("GCA", "TCG") +  h("CAG", "CGT") + h("CAG", "GTC") + h("CAG", "TCG") =  1 + 1 + 0 + 0 + 1 + 1 + 1 + 0 + 1 = 6

Vasya found a string s of length n on the Internet. Now he wants to count how many strings t there are such that the Vasya distance from the string s attains maximum possible value. Formally speaking, t must satisfy the equation: .

Vasya could not try all possible strings to find an answer, so he needs your help. As the answer may be very large, count the number of such strings modulo 10⁹ + 7.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 10⁵).

The second line of the input contains a single string of length n, consisting of characters "ACGT".

Output

Print a single number — the answer modulo 10⁹ + 7.

Example

Input

1
C

Output

1

Input

2
AG

Output

4

Input

3
TTT

Output

1

Note

Please note that if for two distinct strings t₁ and t₂ values ρ(s, t₁) и ρ(s, t₂) are maximum among all possible t, then both strings must be taken into account in the answer even if one of them can be obtained by a circular shift of another one.

In the first sample, there is ρ("C", "C") = 1, for the remaining strings t of length 1 the value of ρ(s, t) is 0.

In the second sample, ρ("AG", "AG") = ρ("AG", "GA") = ρ("AG", "AA") = ρ("AG", "GG") = 4.

In the third sample, ρ("TTT", "TTT") = 27

题解：求出最多的字母个数x。答案就是x^n。

Code：

#include
#include
#include
#include
#include
#include
#define mod 1000000007
#define ll long long 
using namespace std;
int ans,mx,n,num[30];
char ch[100005];
ll power(ll a,ll b)
{
    ll ans=1;a%=mod;
    for(ll i=b;i;i>>=1,a=a*a%mod)
        if(i&1)ans=ans*a%mod;
    return ans;
}
int main()
{
    scanf("%d",&n);
    scanf("%s",ch+1);
    for(int i=1;i<=n;i++)
    {
        num[ch[i]-'A'+1]++;
        mx=max(mx,num[ch[i]-'A'+1]);
    }
    for(int i=1;i<=26;i++)
        if(num[i]==mx)ans++;
    printf("%I64d\n",power(ans,n));
    return 0;
}