#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define PA pair #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) //#include //namespace mp=boost::multiprecision; //using Bint=mp::cpp_int; templateusing min_priority_queue=priority_queue,greater>; templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(bvoid print(vectorA){REP(i,A.size()){if(i)cout<<" ";cout<>N; string S;cin>>S; ll ab=count(ALL(S),'A')+count(ALL(S),'B'); ll cd=N-ab; vectorK(N+1,1); FOR(i,1,N+1)K[i]=i*K[i-1]; cout<<(K[N]/K[ab]/K[cd]).val()<