###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


###############################################################################


def main():
    n = intin()
    slist = [input() for _ in range(n)]

    count = 0
    head_b_list = []
    tail_a_list = []

    for i, s in enumerate(slist):
        bwait = False
        for c in s:
            if c == 'A':
                bwait = True
            else:
                if c == 'B' and bwait:
                    count += 1
                bwait = False

        if s[0] == 'B':
            head_b_list.append(i)
        if s[-1] == 'A':
            tail_a_list.append(i)

    head_b_set = set(head_b_list)
    tail_a_set = set(tail_a_list)

    ba_set = tail_a_set & head_b_set
    only_a = tail_a_set - head_b_set
    only_b = head_b_set - tail_a_set

    if not only_a and not only_b:
        count += max(len(ba_set) - 1, 0)
    elif not only_a:
        count += len(ba_set)
    elif not only_b:
        count += len(ba_set)
    else:
        count += len(ba_set) + 1
        count += min(len(only_a) - 1, len(only_b) - 1)

    print(count)


if __name__ == '__main__':
    main()


Measured memory_bytes: 6516