package main

import . "fmt"
import . "strings"
import . "math/big"

func main() {
	var n int
	var s  string
	Scan(&n, &s)
	ab := Count(s, "A")+Count(s, "B")
	cd := n - ab
	println(ab, cd)
	const Mod = 998244353
	nm := make([]int, 3e5+1)
	nm[0] = 1
	for i := range nm[1:] {
		nm[i+1] = nm[i] * (i+1) % Mod
	}
	dn := make([]int, 3e5+1)
	dn[3e5] = int(new(Int).ModInverse(NewInt(int64(nm[3e5])),NewInt(Mod)).Int64())
	for i := range dn[1:] {
		j := int(3e5) - i
		dn[j-1] = dn[j] * j % Mod
	}
	ans := 0
	ab, cd = min(ab, cd), max(ab, cd)
	for i := 1; i <= ab+1 && i <= cd; i++ {
		tmp1 := nm[ab+1] * dn[i] % Mod * dn[ab+1-i] % Mod
		tmp2 := nm[cd-1] * dn[i-1] % Mod * dn[cd-1-(i-1)] % Mod
		ans += tmp1 * tmp2 % Mod
		ans %= Mod
	}
	Println(ans)
}