from heapq import *

N = int(int(input()))
S = [input() for _ in range(N)]
pos = [[] for _ in range(N)]
nxt = [2*N-1] * N 

for i in range(N):
    for j in range(2*N):
        if S[i][j] == "#":
            pos[i].append(j)

lack = []
rem = []
nxt = [2*N-1] * N
ans = 0
for i in range(N):
    num = len(pos[i])

    for j in range(num-1,-1,-1):
        if nxt[i] <= N-1:
            rem.append((i,pos[i][j]))
        else:
            ans += abs(nxt[i] - pos[i][j])
            nxt[i] -= 1

    for j in range(nxt[i],N-1,-1):
        lack.append((i,j))


num = len(rem)
for i in range(num):
    i0, j0 = rem[i]
    i1, j1 = lack[i]
    ans += abs(i1-i0) + abs(j1-j0)

print(ans)