Problem:
Score : 400 points

Problem Statement

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.

Sample Input 1

3
ABCA
XBAZ
BAD

Sample Output 1

2

For example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.

Sample Input 2

9
BEWPVCRWH
ZZNQYIJX
BAVREA
PA
HJMYITEOX
BCJHMRMNK
BP
QVFABZ
PRGKSPUNA

Sample Output 2

4

Sample Input 3

7
RABYBBE
JOZ
BMHQUVA
BPA
ISU
MCMABAOBHZ
SZMEHMA

Sample Output 3

4

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Linq;

namespace diverta2019C
{
    class Program
    {
        static void Main(string[] args)
        {
            int N = CIN.Int();
            string[] S = new string[N];
            for (int i = 0; i < N; i++)
            {
                S[i] = CIN.String();
            }

            int tailA = 0;
            int startB = 0;
            int containAB = 0;
            for (int i = 0; i < N; i++)
            {
                
                bool A = false;
                for (int j = 0; j < S[i].Length; j++)
                {
                    if (S[i][j] == 'A')
                    {
                        A = true;
                        continue;
                    }
                    if (A && S[i][j] == 'B')
                    {
                        containAB++;
                    }
                    A = false;
                }
                if (S[i][0] == 'B')
                {
                    startB++;
                    continue;
                }

                if (S[i][S[i].Length - 1] == 'A')
                {
                    tailA++;
                }
            }
            
            Console.WriteLine(containAB + Math.Min(N - 1, Math.Min(tailA, startB)));
        }
    }

    internal static class CIN
    {
        public static string String()
        {
            return Console.ReadLine();
        }

        public static int Int()
        {
            return int.Parse(Console.ReadLine());
        }

        public static int[] IntArray()
        {
            return Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
        }

        public static long Long()
        {
            return long.Parse(Console.ReadLine());
        }

        public static long[] LongArray()
        {
            return Console.ReadLine().Split(' ').Select(long.Parse).ToArray();
        }

        public static double[] DoubleArray()
        {
            return Console.ReadLine().Split(' ').Select(double.Parse).ToArray();
        }
    }
}