using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

public class FastQueue<T> {
    private T[] _nodes;
    private int _head;
    private int _tail;
    public int Count { get; private set; }

    public FastQueue(int capacity = 16) {
        _nodes = new T[capacity];
        _head = 0;
        _tail = 0;
    }

    public void Clear() {
        _head = _tail = Count = 0;
    }

    public void Enqueue(T value) {
        Count++;
        if (Count == _nodes.Length) { // expand
            var newNodes = new T[_nodes.Length * 2];
            int nTail = 0;
            while (_head != _tail) {
                newNodes[nTail++] = _nodes[_head];
                _head++;
                if (_head == _nodes.Length) _head = 0;
            }
            _head = 0;
            _tail = nTail;
            _nodes = newNodes;
        }

        _nodes[_tail++] = value;
        _tail %= _nodes.Length;
    }
    public T Dequeue() {
        var ret = _nodes[_head++];
        Count--;
        _head %= _nodes.Length;
        return ret;
    }
}

internal partial class Solver {

    public int[] dx = new int[] { 0, 1, 0, -1 };
    public int[] dy = new int[] { 1, 0, -1, 0 };

    public void Run() {
        var n = ni();
        var p = ni(n * n);

        //n = 500; p = E.Range(1, n * n).ToArray();

        var a = new int[n, n];
        var cost = new int[n * n];
        var weight = new int[n * n];
        var rows = new int[n * n];
        var cols = new int[n * n];
        int ToIndex(int r, int c) => r * n + c;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                var val = i * n + j;
                a[i, j] = val;
                var id = ToIndex(i, j);
                weight[id] = 1;
                rows[val] = i;
                cols[val] = j;
                cost[id] = Math.Min(Math.Min(i, n - 1 - i), Math.Min(j, n - 1 - j));
            }
        }
        long ans = 0;
        var queue = new FastQueue<(int, int, int)>((n + 2) * (n + 2));
        var next = new FastQueue<(int, int, int)>((n + 2) * (n + 2));
        for (int i = 0; i < p.Length; i++) {
            var row = rows[p[i] - 1];
            var col = cols[p[i] - 1];
            var ids = ToIndex(row, col);
            ans += cost[ids];
            weight[ids] = 0;

            int minAdjCost = int.MaxValue;

            for (int k = 0; k < 4; k++) {
                var nr = row + dy[k];
                var nc = col + dx[k];
                if (0 <= nr && nr < n && 0 <= nc && nc < n) {
                    minAdjCost = Math.Min(minAdjCost, cost[ToIndex(nr, nc)]);
                } else {
                    minAdjCost = -1;
                    break;
                }
            }

            if (cost[ids] > minAdjCost) {
                queue.Enqueue((row, col, minAdjCost));
                while (queue.Count > 0) {
                    while (queue.Count > 0) {
                        var (crow, ccol, step) = queue.Dequeue();
                        var id = ToIndex(crow, ccol);
                        if (cost[id] <= step) continue;
                        cost[id] = step;
                        {
                            var nr = crow + 1;
                            var nc = ccol + 0;
                            if (0 <= nr && nr < n && 0 <= nc && nc < n) {
                                var nid = ToIndex(nr, nc);
                                var w = weight[nid];
                                if (cost[nid] > step + w) {
                                    if (w == 0) {
                                        queue.Enqueue((nr, nc, step));
                                    } else {
                                        next.Enqueue((nr, nc, step + 1));
                                    }
                                }
                            }
                        }
                        {
                            var nr = crow + 0;
                            var nc = ccol + 1;
                            if (0 <= nr && nr < n && 0 <= nc && nc < n) {
                                var nid = ToIndex(nr, nc);
                                var w = weight[nid];
                                if (cost[nid] > step + w) {
                                    if (w == 0) {
                                        queue.Enqueue((nr, nc, step));
                                    } else {
                                        next.Enqueue((nr, nc, step + 1));
                                    }
                                }
                            }
                        }
                        {
                            var nr = crow - 1;
                            var nc = ccol + 0;
                            if (0 <= nr && nr < n && 0 <= nc && nc < n) {
                                var nid = ToIndex(nr, nc);
                                var w = weight[nid];
                                if (cost[nid] > step + w) {
                                    if (w == 0) {
                                        queue.Enqueue((nr, nc, step));
                                    } else {
                                        next.Enqueue((nr, nc, step + 1));
                                    }
                                }
                            }
                        }
                        {
                            var nr = crow + 0;
                            var nc = ccol - 1;
                            if (0 <= nr && nr < n && 0 <= nc && nc < n) {
                                var nid = ToIndex(nr, nc);
                                var w = weight[nid];
                                if (cost[nid] > step + w) {
                                    if (w == 0) {
                                        queue.Enqueue((nr, nc, step));
                                    } else {
                                        next.Enqueue((nr, nc, step + 1));
                                    }
                                }
                            }
                        }
                    }
                    Swap(ref queue, ref next);
                }
                //cost.Dump();
            }
        }

        cout.WriteLine(ans);
    }

    public static void Swap<T>(ref T lhs, ref T rhs) { T temp; temp = lhs; lhs = rhs; rhs = temp; }
}
public class BooleanArray {
    private readonly int[] array;
    private int trueValue = 1;

    public BooleanArray(int size) {
        array = new int[size];
    }

    public void Clear() {
        trueValue++;
    }

    public bool this[int index] {
        get {
            return array[index] == trueValue;
        }
        set {
            array[index] = value ? trueValue : trueValue - 1;
        }
    }

    public int Length {
        get {
            return array.Length;
        }
    }
}

// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}


Measured memory_bytes: 49108