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 <iostream>
using namespace std;
int main(void){
    int n, m=0, d[4];
    cin>>n;
    fill(d, d+4, 0);
    for(int i=0;i<n;i++){
        int l;
        string s;
        cin>>s;
        l=s.length();
        for(int j=0;j<l-1;j++){
            if(s[j]=='A'&&s[j+1]=='B')m++;
        }
        if(s[0]=='B'&&s[l-1]=='A')d[3]++;
        else if(s[0]=='B')d[2]++;
        else if(s[l-1]=='A')d[1]++;
        else d[0]++;
    }
    if(d[3]>1){
        m+=d[3]-1;
        d[3]=1;
    }
    if(d[3]>0&&(d[1]>0||d[2]>0))m++;
    m+=min(d[1], d[2]);
    cout<<m<<endl;
}
