use std::cmp;
use std::cmp::Reverse;
use std::collections::{BinaryHeap, VecDeque};

const INF: usize = 1 << 30;
fn main() {
    let (r, w) = (std::io::stdin(), std::io::stdout());
    let mut sc = IO::new(r.lock(), w.lock());

    let n: usize = sc.read();
    let p: Vec<usize> = (0..(n * n)).map(|_| sc.read::<usize>() - 1).collect();
    let mut dist = vec![vec![INF; n]; n];
    let mut q = VecDeque::new();
    for i in 0..n {
        dist[i][0] = 0;
        q.push_back((i, 0));
        dist[i][n - 1] = 0;
        q.push_back((i, n - 1));
        dist[0][i] = 0;
        q.push_back((0, i));
        dist[n - 1][i] = 0;
        q.push_back((n - 1, i));
    }

    while let Some((i, j)) = q.pop_front() {
        for (ni, nj) in next(i, j, n).into_iter() {
            if dist[ni][nj] > dist[i][j] + 1 {
                dist[ni][nj] = dist[i][j] + 1;
                q.push_back((ni, nj));
            }
        }
    }

    let mut empty = vec![vec![false; n]; n];

    let mut heap = BinaryHeap::<(Reverse<usize>, usize, usize)>::new();
    let mut sum = 0;
    for p in p.into_iter() {
        let i = p / n;
        let j = p % n;
        let ans = dist[i][j];

        while let Some((Reverse(d), i, j)) = heap.pop() {
            if dist[i][j] < d {
                continue;
            }
            if d >= ans {
                heap.push((Reverse(d), i, j));
                break;
            }
            let cost = if empty[i][j] { 0 } else { 1 };
            for (ni, nj) in next(i, j, n).into_iter() {
                if dist[ni][nj] > dist[i][j] + cost {
                    dist[ni][nj] = dist[i][j] + cost;
                    heap.push((Reverse(dist[ni][nj]), ni, nj));
                }
            }
        }

        sum += dist[i][j];
        empty[i][j] = true;

        for (ni, nj) in next(i, j, n).into_iter() {
            if dist[ni][nj] >= dist[i][j] + 1 {
                dist[ni][nj] = dist[i][j];
                heap.push((Reverse(dist[ni][nj]), ni, nj));
            }
        }
    }
    println!("{}", sum);
}

pub struct UnionFind {
    parent: Vec<usize>,
    sizes: Vec<usize>,
    dist: Vec<usize>,
    size: usize,
}

impl UnionFind {
    pub fn new(n: usize, dist: Vec<usize>) -> UnionFind {
        UnionFind {
            parent: (0..n).map(|i| i).collect::<Vec<usize>>(),
            sizes: vec![1; n],
            dist,
            size: n,
        }
    }

    pub fn find(&mut self, x: usize) -> usize {
        if x == self.parent[x] {
            x
        } else {
            let px = self.parent[x];
            self.parent[x] = self.find(px);
            self.parent[x]
        }
    }

    pub fn unite(&mut self, x: usize, y: usize) -> bool {
        let parent_x = self.find(x);
        let parent_y = self.find(y);
        if parent_x == parent_y {
            return false;
        }

        let (large, small) = if self.sizes[parent_x] < self.sizes[parent_y] {
            (parent_y, parent_x)
        } else {
            (parent_x, parent_y)
        };

        self.parent[small] = large;
        self.sizes[large] += self.sizes[small];
        self.sizes[small] = 0;

        self.dist[large] = cmp::min(self.dist[large], self.dist[small]);
        self.dist[small] = 0;

        self.size -= 1;
        true
    }
}

fn next(i: usize, j: usize, n: usize) -> Vec<(usize, usize)> {
    let mut result = vec![];
    if i > 0 {
        result.push((i - 1, j));
    }
    if j > 0 {
        result.push((i, j - 1));
    }
    if i + 1 < n {
        result.push((i + 1, j));
    }
    if j + 1 < n {
        result.push((i, j + 1));
    }
    result
}

pub struct IO<R, W: std::io::Write>(R, std::io::BufWriter<W>);

impl<R: std::io::Read, W: std::io::Write> IO<R, W> {
    pub fn new(r: R, w: W) -> Self {
        Self(r, std::io::BufWriter::new(w))
    }
    pub fn write<S: ToString>(&mut self, s: S) {
        use std::io::Write;
        self.1.write(s.to_string().as_bytes()).unwrap();
    }
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .0
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r' || b == b'\t')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r' && b != b'\t')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}
