#include <iostream> 
#include <vector>
#include <algorithm>

using namespace std; 

using ll = long long; 

int ages[1505][1505];

int main() {
    ios::sync_with_stdio(0); 
    cin.tie(0); 

    int n; 
    cin >> n; 

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> ages[i][j];
        }
    }

    vector<int> less_in_row(n*n + 1); 
    vector<int> less_in_col(n*n + 1); 

    for (int i = 0; i < n; i++) {
        vector<int> curr_row(n); 
        for (int j = 0; j < n; j++) {
            curr_row[j] = ages[i][j]; 
        }
        sort(curr_row.begin(), curr_row.end()); 
        for (int i = 0; i < n; i++) {
            less_in_row[curr_row[i]] = i;
        }
    }

    for (int j = 0; j < n; j++) {
        vector<int> curr_col(n); 
        for (int i = 0; i < n; i++) {
            curr_col[i] = ages[i][j]; 
        }
        sort(curr_col.begin(), curr_col.end()); 
        for (int i = 0; i < n; i++) {
            less_in_col[curr_col[i]] = i;
        }
    }    

    ll sum = 0; 
    for (int k = 1; k <= n*n; k++) {
        sum += (less_in_row[k]*(n - 1 - less_in_col[k]) + less_in_col[k]*(n - 1 - less_in_row[k])); 
    }

    sum /= 2; 
    cout << sum; 
}