import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
bool minimize(T)(ref T x, T y) { if (x > y) { x = y; return true; } else { return false; } }
bool maximize(T)(ref T x, T y) { if (x < y) { x = y; return true; } else { return false; } }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto s = new string[](N);

	foreach (i; 0..N)
	{
		s[i] = RD!string;
	}

	long cnt_ab;
	long cnt_a, cnt_b, cnt_a_b;
	foreach (i; 0..N)
	{
		foreach (j; 1..s[i].length)
		{
			if (s[i][j-1] == 'A' && s[i][j] == 'B')
			{
				++cnt_ab;
			}
		}
		if (s[i][$-1] == 'A' && s[i][0] == 'B')
		{
			++cnt_a_b;
		}
		else
		{
			if (s[i][$-1] == 'A')
				++cnt_a;
			if (s[i][0] == 'B')
				++cnt_b;
		}
	}
	auto ans = max(0, cnt_a_b - 1);
	if (cnt_a_b != 0)
	{
		if (cnt_a != 0)
		{
			++ans;
			--cnt_a;
		}
		if (cnt_b != 0)
		{
			++ans;
			--cnt_b;
		}
	}
	ans += min(cnt_a, cnt_b);
	ans += cnt_ab;

	writeln(ans);
	stdout.flush();
	debug readln();
}