Problem: You are given a string S of length 2N consisting of lowercase English letters.

There are 2^{2N} ways to color each character in S red or blue. Among these ways, how many satisfy the following condition?

* The string obtained by reading the characters painted red from left to right is equal to the string obtained by reading the characters painted blue from right to left.

Constraints

* 1 \leq N \leq 18
* The length of S is 2N.
* S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:


N
S


Output

Print the number of ways to paint the string that satisfy the condition.

Examples

Input

4
cabaacba


Output

4


Input

11
mippiisssisssiipsspiim


Output

504


Input

4
abcdefgh


Output

0


Input

18
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa


Output

9075135300

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

string substring(int L, string S, ull mask){
    string s="",r="";
    for(int i=0;i<L;i++){
        if((1<<i)&mask) s+=S[i];
        else r+=S[i];
    }
    return s+","+r;
}

int main(){
    int N;
    string S;
    cin >> N >> S;

    string A,B;
    A=S.substr(0,N);
    B="";
    for(int i=1;i<=N;i++){
        B=B+S[2*N-i];
    }

    map<string,ll> cA,cB;
    for(ull m=0;m<(1<<N);m++){
        cA[substring(N,A,m)]++;
        cB[substring(N,B,m)]++;
    }

    ll ans=0;
    for(auto x : cA){
        ans+=x.second*cB[x.first];
    }

    cout << ans << endl;

    return 0;
}