Задача Пираты Баренцева моря

n = int(input())
mp = [[0 for i in range(n)] for j in range(n)]
points= []
stolb = [0]*n
for i in range(n):
    a, b= list(map(int, input().split()))
    mp[b-1][a-1]=1
    points.append([a-1, b-1])
    stolb[b-1] += 1
if n == 1:
    print(0)
else:
    ch = n
    indmx = 0
    path = 0
    many = []
    mxst = max(stolb)
    for i in range(n):
        if stolb[i] == mxst:
            ind = i
            many.append(i)
 
    mnrsn = n
    if len(many)>1:
        for i in many:
            if abs(i - (n-1)//2) < mnrsn:
                mnrsn = abs(i - n//2)
                print(mnrsn)
                ind = i
    print(ind, many)
    for i in range(n):
        print(mp[i])
    print('')
    for i in range(n):
        x, y = points[i][1], points[i][0]
        mp[x][y] = 0
        y_new = y
        if mp[ind][y_new%n]==1:
            y_new = 0
            while y_new<n and mp[ind][y_new%n]==1:
                y_new += 1
        mp[ind][y_new%n] = 1
        path += abs(x-ind) + abs(y-y_new%n)
    for i in range(n):
        print(mp[i])
    print(path)

print((lambda n:(lambda ships:(lambda distance:(lambda minsum:min(minsum(j) for j in range(1, n + 1)))(lambda j:sum(distance(i, j, *k.pop()) for k in [ships[:]] for i in range(1, n + 1))))(lambda x1, y1, x2, y2:abs(x1 - x2) + abs(y1 - y2)))(sorted([tuple(map(int, input().split())) for _ in range(n)], reverse=True)))(int(input())))

(lambda dic, n, m:([(lambda s:None if s in dic else (lambda pre, actions:None)(dic.update([(s, s)]), [(lambda t:(lambda action:None)((dic.update([(t, s)]) if s < dic[t] else None) if t in dic else dic.update([(t, s)])))(s[:i] + '?' + s[i + 1:]) for i in range(len(s))]))(input()) for _ in range(n)],[(lambda s:print(dic[s] if s in dic else (lambda onedifs:min(onedifs) if len(onedifs) else '?')(list(map(lambda key:dic[key], filter(lambda t: t in dic, (s[:i] + '?' + s[i + 1:] for i in range(len(s)))))))))(input()) for _ in range(m)]))({}, *map(int, input().split()))

(lambda d, s, n, m:([(lambda w:(s.add(w), [d.update([(k, min(d[k], w) if k in d else w)]) for k in ((w[:i], w[i+1:]) for i in range(len(w)))]))(input()) for _ in range(n)],[print((lambda w:w if w in s else (lambda r:min(r) if len(r) else '?')([d[k] for k in ((w[:i], w[i+1:]) for i in range(len(s))) if k in d]))(input())) for _ in range(m)]))({}, set(), *map(int, input().split()))

(lambda d, s, n, m:([(lambda w:(s.add(w), [d.update([(k, min(d[k], w) if k in d else w)]) for k in ((w[:i], w[i+1:]) for i in range(len(w)))]))(input()) for _ in range(n)], [print((lambda w:w if w in s else (lambda r:min(r) if len(r) else '?')([d[k] for k in ((w[:i], w[i+1:]) for i in range(len(w))) if k in d]))(input())) for _ in range(m)]))({}, set(), *map(int, input().split()))