Problem:
Score : 400 points

Problem Statement

Snuke has N strings. The i-th string is s_i.

Let us concatenate these strings into one string after arranging them in some order.
Find the maximum possible number of occurrences of AB in the resulting string.

Constraints

1 \leq N \leq 10^{4}

2 \leq |s_i| \leq 10

s_i consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:

N
s_1
\vdots
s_N

Output

Print the answer.

Sample Input 1

3
ABCA
XBAZ
BAD

Sample Output 1

2

For example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.

Sample Input 2

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA

Sample Output 2

4

Sample Input 3

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA

Sample Output 3

4

Solution in Go (1.6) (judge verdict: Wrong Answer)

package main

import (
	"fmt"
	"strings"
)

// 先頭がB以外が最低1つあればAとBの最小値が答え
func main() {
	var N, ans, a, b, c int
	fmt.Scan(&N)
	var s = make([]string, N)
	for i := 0; i < N; i++ {
		fmt.Scan(&s[i])
		ans += strings.Count(s[i], "AB")
		aaa := strings.HasSuffix(s[i], "A")
		bbb := strings.HasPrefix(s[i], "B")
		if aaa {
			a++
		}
		if bbb {
			b++
		}
		if aaa && bbb {
			c++
		}
	}
	if a == c && b == c {
		ans += a - 1
	} else if a == c {
		ans += a
	} else if b == c {
		ans += b
	} else if a > b {
		ans += b
	} else {
		ans += a
	}
	// fmt.Printf("%v %v %v\n", a, b, c)
	fmt.Printf("%v\n", ans)
}