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
#include<bits/stdc++.h>
using namespace std;
const int N=1e4+5;
int n;
int main()
{
    scanf("%d",&n);
    int ans=0,l=0,r=0,flag=false;
    for(int i=1;i<=n;i++)
    {
        char s[15];
        scanf("%s",s+1);
        int m=strlen(s+1);
        if(s[1]=='B') l++;
        if(s[m]=='A') r++;
        if(!(s[1]=='B'&&s[m]=='A')&&(s[1]=='B'||s[m]=='A')) flag=true;
        for(int i=1;i<m;i++)
            if(s[i]=='A'&&s[i+1]=='B') ans++;
    }
    ans+=min(l,r);
    if(!flag&&min(l,r)>0) ans--;
    printf("%d\n",ans);
}
