import bisect
import math
import string
import sys
from collections import defaultdict
from itertools import accumulate
from math import isqrt, inf
from typing import List, Tuple

sys.setrecursionlimit(10 ** 6)

MOD = 998244353

int1 = lambda x: int(x) - 1
input = lambda: sys.stdin.readline().rstrip('\n')
ii = lambda: int(input())
vi = lambda: list(map(int, input().split()))
vi1 = lambda: list(map(int1, input().split()))


def dbg(*args, **kwargs):
    print(*(repr(arg) for arg in args), *(f'{k}: {repr(v)}' for k, v in kwargs.items()),
          sep='; ', file=sys.stderr, flush=True)


def main():
    n = ii()
    xs = []
    ys = []
    for i in range(n):
        z = input()
        for j in range(2 * n):
            if z[j] == '.':
                xs.append(i)
                ys.append(j)
    xs.sort()
    ys.sort()
    ans = 0
    for i in range(n * n):
        ans += abs(xs[i] - i // n) + abs(ys[i] - i // n)

    return ans


def _start():
    if (ret := main()) is not None:
        print(*ret) if isinstance(ret, List) or isinstance(ret, Tuple) else print(ret)


if __name__ == '__main__':
    _start()