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
#import<regex>

long long a,b,c,i,j,k,n,t;char s[12];

int main()

{

for(scanf("%lld ",&n);i++<n;)

{for(scanf("%s",s),j=0;s[j];j++)t+=s[j]==65&&s[j+1]==66;
a+=s[j-1]==65&&s[0]^66;b+=s[0]==66&&s[j-1]^65;c+=s[j-1]==65&&s[0]==66;}
k=c?c-1:0,a&&c?a--,k++:0,b&&c?b--,k++:0,k+=a<b?a:b;
printf("%lld",t+k);

}

