#include <bits/stdc++.h>
using namespace std;
template <class T>
class depth_first_search_iterator {
 public:
  stack<pair<T, T>> todo;
  function<bool(T)> notvisited;
  function<void(T)> mark_visited;
  function<set<T>(T)> neighbors;
  depth_first_search_iterator() {}
  depth_first_search_iterator(T start, function<bool(T)> notv,
                              function<void(T)> mark_v,
                              function<set<T>(T)> neigh)
      : notvisited(notv),
        mark_visited(mark_v),
        neighbors(neigh),
        end_(false),
        current(start),
        prev(start) {
    todo.push(make_pair(start, start));
    operator++();
  }
  void operator++() {
    end_ = true;
    while (!todo.empty()) {
      current = todo.top().first;
      prev = todo.top().second;
      todo.pop();
      if (notvisited(current)) {
        mark_visited(current);
        for (const T x : neighbors(current)) {
          todo.push(make_pair(x, current));
        }
        end_ = false;
        break;
      }
    }
  }
  T operator*() { return current; }
  T previous() { return prev; }
  bool end() { return end_; }

 private:
  T current;
  T prev;
  bool end_;
};
template <class T>
class breadth_first_search_iterator {
 public:
  queue<pair<T, T>> todo;
  function<bool(T)> notvisited;
  function<void(T)> mark_visited;
  function<set<T>(T)> neighbors;
  breadth_first_search_iterator() {}
  breadth_first_search_iterator(T start, function<bool(T)> notv,
                                function<void(T)> mark_v,
                                function<set<T>(T)> neigh)
      : notvisited(notv),
        mark_visited(mark_v),
        neighbors(neigh),
        end_(false),
        current(start),
        prev(start) {
    todo.push(make_pair(start, start));
    operator++();
  }
  void operator++() {
    end_ = true;
    while (!todo.empty()) {
      current = todo.front().first;
      prev = todo.front().second;
      todo.pop();
      if (notvisited(current)) {
        mark_visited(current);
        for (const T x : neighbors(current)) {
          todo.push(make_pair(x, current));
        }
        end_ = false;
        break;
      }
    }
  }
  T operator*() { return current; }
  T previous() { return prev; }
  bool end() { return end_; }

 private:
  T current;
  T prev;
  bool end_;
};
template <class T>
class Graph {
 public:
  vector<T> vertices;
  vector<set<int>> neighbors;
  depth_first_search_iterator<int> dfs_iterator;
  breadth_first_search_iterator<int> bfs_iterator;
  vector<bool> visited;
  Graph() {}
  Graph(int n) {
    for (int i = 0; i < n; ++i) {
      AddVertex(0);
    }
  }
  void AddVertex(T val) {
    vertices.push_back(val);
    neighbors.push_back(set<int>());
  }
  bool EdgeExists(int i, int j) {
    return (neighbors[i].find(j) != neighbors[i].end());
  }
  void AddEdge(int i, int j) {
    if (!EdgeExists(i, j)) {
      neighbors[i].insert(j);
      if (i != j) {
        neighbors[j].insert(i);
      }
    }
  }
  T& operator[](int i) { return vertices[i]; }
  void RemoveEdge(int i, int j) {
    if (EdgeExists(i, j)) {
      neighbors[i].erase(find(neighbors[i].begin(), neighbors[i].end(), j));
      neighbors[j].erase(find(neighbors[j].begin(), neighbors[j].end(), i));
    }
  }
  void dfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    dfs_iterator = depth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void bfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    bfs_iterator = breadth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void print_() {
    for (int i = (0); i < (0) + (vertices.size()); ++i) {
      for (auto x : neighbors[i]) {
        if (i <= x) {
          cout << i << "-" << x << endl;
        }
      }
    }
  }
};
int main() {
  cout.precision(17);
  long long modd = 1000 * 1000 * 1000 + 7;
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  uniform_int_distribution<int> rand_gen(0, modd);
  long long infinit = 10000000000000000;
  for (int t = (1); t < (1) + (1); ++t) {
    int n;
    cin >> n;
    vector<int> a;
    for (int i = (0); i < (0) + (n * n); ++i) {
      int kk;
      cin >> kk;
      a.push_back(kk - 1);
    }
    int ret = 0;
    Graph<int> g(n * n + 1);
    for (int i = (0); i < (0) + (n); ++i) {
      for (int j = (0); j < (0) + (n); ++j) {
        int pt = n * i + j;
        if (i > 0) {
          g.AddEdge(pt, n * (i - 1) + j);
        }
        if (i < n - 1) {
          g.AddEdge(pt, n * (i + 1) + j);
        }
        if (j > 0) {
          g.AddEdge(pt, n * i + (j - 1));
        }
        if (j < n - 1) {
          g.AddEdge(pt, n * i + (j + 1));
        }
      }
    }
    for (int i = (0); i < (0) + (n); ++i) {
      g.AddEdge(n * n, n * (0) + i);
      g.AddEdge(n * n, n * (n - 1) + i);
      g.AddEdge(n * n, n * i + 0);
      g.AddEdge(n * n, n * i + n - 1);
    }
    vector<bool> already_gone(n * n, false);
    vector<int> answer(n * n);
    for (int i = (0); i < (0) + (n); ++i) {
      for (int j = (0); j < (0) + (n); ++j) {
        answer[n * i + j] = min({i, j, n - 1 - i, n - 1 - j});
      }
    }
    for (int i = (0); i < (0) + (n * n); ++i) {
      ret += answer[a[i]];
      already_gone[a[i]] = true;
      vector<bool> visited(g.vertices.size(), false);
      stack<int> todo;
      todo.push(a[i]);
      while (!todo.empty()) {
        int current = todo.top();
        todo.pop();
        if (visited[current]) {
          continue;
        }
        visited[current] = true;
        int val = answer[current] + !already_gone[current];
        for (int x : g.neighbors[current]) {
          if (answer[x] > val) {
            answer[x] = val;
            todo.push(x);
          }
        }
      }
    }
    cout << ret << endl;
  }
  return 0;
}
