n = gets.to_i
xa = 0
bx = 0
ba = 0
fixed = 0
n.times do |i|
  s = gets.strip
  bx += 1 if s[0] == 'B' && s[-1] != 'A'
  xa += 1 if s[-1] == 'A' && s[0] != 'B'
  ba += 1 if s[0] == 'B' && s[-1] == 'A'
  for i in 0...s.length - 1
    break if i == s.length - 1
    fixed += 1 if s[i] == 'A' && s[i + 1] == 'B'
  end
end
#puts "bx: #{bx}, xa: #{xa}, ba: #{ba}, fixed: #{fixed}"
p0 = [xa, bx].min
xdiff = (xa - bx).abs
p1 = [ba - p0, ba].max
abdiff = p1 - ba
p2 = [abdiff, xdiff].min
puts fixed + p0 + p1 + p2
