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.

Examples

Input

3
ABCA
XBAZ
BAD


Output

2


Input

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA


Output

4


Input

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA


Output

4
# coding:utf-8

import math
import re

def main(params):
    total = 0
    a = []
    b = []
    for i in range(len(params)):
        s = params[i]
        total += s.count("AB")
        if s[0] == "B":
            b.append(i)
        if s[-1:] == "A":
            a.append(i)
    if min(len(a),len(b)) > 0 and len(a) == len(b):
        total += min(len(a), len(b))
        chk = True
        for i in a:
            if not i in b:
                chk = False
        if chk == True:
            total -= 1
    else:
        total += min(len(a),len(b))
    print total

if __name__ == "__main__":
    n = int(raw_input())
    #cnt = 1 # TODO: edit here
    params = []
    for i in range(n):
        param = raw_input()
        params.append(param)
    main(params)

