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
n=int(input())
ans=0;BA,BB,AA=0,0,0
for i in range(n):
  s=input()
  for i in range(len(s)-1):
    if s[i]+s[i+1]=="AB":ans+=1
  if s[0]+s[-1]=="BA":BA+=1
  elif s[-1]=="A":AA+=1
  elif s[0]=="B":BB+=1
if BA==0:print(ans+min(AA,BB))
else:
  ans+=BA-1
  BA=1
  if AA!=0:AA-=1;ans+=1
  if BB!=0:BB-=1;ans+=1
  print(ans+min(AA,BB))