#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;
template < typename T = int > using OSI = ostream_iterator< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )

#define SZ( v ) ( (int)( v ).size() )
#define EXISTS( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

//     Λ   Λ＿_
//  ／(*ﾟーﾟ)／＼
// ／| ￣U U￣|＼／
//   |      |／

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

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	IN( int, N );
	VI P( N * N );
	cin >> P;
	transform( ALL( P ), begin( P ), bind( minus< int >(), _1, 1 ) );

	static int distances[ 512 ][ 512 ];
	REP( i, N )
	{
		REP( j, N )
		{
			distances[i][j] = min( {
				i + 1, N - i,
				  j + 1, N - j } );
		}
	}

	const auto dump_distances = [&]{
		REP( i, N )
		{
			REP( j, N )
			{
				cerr << distances[i][j] << ' ';
			}
			cerr << '\n';
		}
		cerr << endl;
	};
// 	dump_distances();

	static int occupied[ 512 ][ 512 ];
	fill( AALL( occupied ), 1 );
	
	LL res = 0;
	FOR( p, P )
	{
		const int pi = p / N;
		const int pj = p % N;

// 		cerr << pi << ' ' << pj << endl;
		occupied[ pi ][ pj ] = 0;

		if ( distances[ pi ][ pj ] == 0 )
		{
// 			assert( false );
			continue;
		}

		res += distances[ pi ][ pj ] - 1;
		--distances[ pi ][ pj ];

		queue< PII > que;
		que.EM( pi, pj );

		const auto inside = [&]( const int y, const int x )
		{
			return 0 <= y && y < N && 0 <= x && x < N;
		};

		while ( !que.empty() )
		{
			const int y = que.front().fst;
			const int x = que.front().snd;
			que.pop();

			REP( d, 4 )
			{
				const int ny = y + dy[d];
				const int nx = x + dx[d];

				if ( inside( ny, nx ) && chmin( distances[ ny ][ nx ], distances[y][x] + occupied[ ny ][ nx ] ) )
				{
					que.EM( ny, nx );
				}
			}
		}
// 		dump_distances();
// 		DUMP( res );
	}

	cout << res << endl;

	return 0;
}

Measured memory_bytes: 6368