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(){
    long long n,ans=0,a=0,b=0,c=0;
    
    cin >> n;
    int j=0;
    
    for(int i=0;i<n;i++){
        char s[15];
        cin >> s;
        for(j=0;s[j]!='\0';j++){
            if(s[j]=='A'&&s[j+1]=='B')ans++;
        }
        if(s[0]=='B')b++;
        if(s[j-1]=='A')a++;
        if(s[0]=='B'&&s[j-1]=='A')c++;
    }
    if(c==a && c==b && c>0){
        cout << ans + c - 1 << endl;
    }else{
        cout << ans + min(a,b) << endl;
    }
    
}