#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int Nmax = 1505;

int smaller1[Nmax][Nmax], smaller2[Nmax][Nmax];
int a[Nmax][Nmax], b[Nmax][Nmax];
int n;

void compute(int a[Nmax][Nmax], int smaller[Nmax][Nmax]) // smaller[i][j] = # smaller values on row a[i] than a[i][j]
{
    int i, j;
    vector<int> ord(n);
    iota(ord.begin(), ord.end(), 1);

    for(i=1; i<=n; ++i)
    {
        sort(ord.begin(), ord.end(), [&] (int x, int y) { return a[i][x] < a[i][y]; });

        for(j=0; j<n; ++j)
            smaller[i][ord[j]] = j;
    }
}

int main()
{

    cin.tie(0); cin.sync_with_stdio(false);

    cin >> n;

    int i, j;
    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j)
            cin >> a[i][j];

    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j)
            b[i][j] = a[j][i];

    compute(a, smaller1);
    compute(b, smaller2);

    ll ans = 0;
    for(i=1; i<=n; ++i)
        for(j=1; j<=n; ++j)
            ans += (ll) smaller1[i][j] * (n - 1 - smaller2[j][i]) + (ll) smaller2[j][i] * (n - 1 - smaller1[i][j]);

    cout << ans / 2 << '\n';

    return 0;
}