Niitty

# rows = [
#   ["A","A","A","K"],
#   ["A","B","A","A"],
#   ["A","B","A","A"],
#   ["A","A","A","A"]
# ]
rows = []
for _ in range(int(input())):
  rows.append(list(input()))
#print(rows)
plants = set(sum(rows, []))
 
possible = 0 # Ulkoreuna on aina yksi aitaus
 
# Niitty koostuu n x n ruudusta, eli se on neliö
width = len(rows)
height = len(rows)
x = 0
y = 0

def validArea(x = 0, y = 0, width = 1, height = 1):
  temp_rows = rows[y:(height+y)]
  for i, row in enumerate(temp_rows):
    temp_rows[i] = row[x:(width+x)]
  return set(sum(temp_rows, [])) == plants

# Etsitään kaikkien esiintyvien kasvien ensimmäinen sijanti,
# ja rakennetaan siitä suorakulmio
def superSearch():
    left = list(plants)
    values = []
    for y, row in enumerate(rows):
        for x, plant in enumerate(row):
            if plant in left:
                left.remove(plant)
                values.append([x,y])
                if len(left) == 0:
                    break
    box_x = min([item[0] for item in values])
    box_width = max([item[0] for item in values]) + 1
    box_y = min([item[1] for item in values])
    box_height = max([item[1] for item in values]) + 1
    return [box_x, box_y, box_width, box_height]

possibles = 0

box = superSearch()
box_x = box[0]
box_y = box[1]
box_width = box[2]
box_height = box[3]

# Vasemmalta
for _ in range(width):
    if validArea(box_x + 1, box_y, box_width - 1, box_height):
        box_x += 1
        box_width -= 1
    else:
        break
# Ylhäältä
for _ in range(height - box_height):
    if validArea(box_x, box_y + 1, box_width, box_height - 1):
        box_y += 1
        box_height -= 1
    else:
        break
# Oikealta
for _ in range(1, box_width):
    if validArea(box_x, box_y, box_width - 1, box_height):
        box_width -= 1
    else:
        break
# Alhaalta
for _ in range(1, box_height):
    if validArea(box_x, box_y, box_width, box_height - 1):
        box_height -= 1
    else:
        break

# Kaikki tätä laatikkoa suuremmat arvot ovat mahdollisia (x pienemmät ja width->(leveys-x))

free_space_left = box_x
free_space_right = width-box_width-x
free_space_up = box_y
free_space_down = height-box_height-y

def areaIncluded(x1, y1, w1, h1, x2, y2, w2, h2):
    if x2 > x1 or w2 < (w1 + x1 - x2):
        return False
    if y2 > y1 or h2 < (h1 + y1 - y2):
        return False
    return True
    
# Joo tässä varmaan saisi jotenkin hienosti tarkastettua, mutta tehdääs laiskasti vaan taas kaikki :D
for x in range(len(rows)):
  for y in range(len(rows)):
    for width in range(1, len(rows) - x + 1):
      for height in range(1, len(rows) - y + 1):
        if areaIncluded(box_x, box_y, box_width, box_height, x, y, width, height):
            possibles += 1
print(possibles)

Test 1

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 3

Group: 1, 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3, 4, 5, 6

Verdict: ACCEPTED

Test 6

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 7

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 8

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 9

Group: 2, 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 10

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 11

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 12

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 13

Group: 3, 4, 5, 6

Verdict: WRONG ANSWER

Test 14

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 15

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 16

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 17

Group: 4, 5, 6

Verdict: WRONG ANSWER

Test 18

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 19

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 20

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 21

Group: 5, 6

Verdict: TIME LIMIT EXCEEDED

Test 22

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 23

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 24

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 25

Group: 6

Verdict: TIME LIMIT EXCEEDED