#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for(int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define cmx(x, y) x = max(x, y)
#define cmn(x, y) x = min(x, y)
#define ary(k) array<int, k>
typedef pair<int, int> pii;
typedef vector<int> vi;

int kra[302][302];
int out[302];

vector<int> createSequence(int n) {
    vector<int> cols;
    for (int iter = 0; iter < n; iter++) {
        for (int i = 0; i < n; i++) {
            if (out[i])
                continue;
            int col = -1, ile = 0;
            for (int j = 0; j < n; j++) {
                if (i != j && !out[j])
                    col = kra[i][j];
            }
            for (int j = 0; j < n; j++) {
                if (!out[j] && kra[i][j] == col)
                    ile++;
            }
            if (ile == n - iter - 1) {
                cols.PB(col);
                out[i] = 1;
                break;
            }
        }
    }
    return cols;
}

const int mod = 1000000007;
int ile[302];
int dwumian[302][302];
int how_many[302][302], prefix[302][302], sufix[302][302];
int result[302][302];

inline int exactly(int c, int x) {
    if (x == 0)
        return how_many[c][x];
    return how_many[c][x] - how_many[c][x-1];
}

inline int dwu(int n, int k) {
    return dwumian[n][k];
}

signed main() {
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> kra[i][j];
        }
    }

    for (int i = 0; i <= n; i++) {
        dwumian[i][0] = dwumian[i][i] = 1;
        for (int j = 1; j < i; j++) {
            dwumian[i][j] = dwumian[i-1][j-1] + dwumian[i-1][j];
            dwumian[i][j] %= mod;
        }
    }

    // Creating sequence
    vector<int> col = createSequence(n);

    // Solving
    int res = 0;
    for (int pref = 0; pref < n-1; pref++) {
        ile[col[pref]]++;
        for (int x = 0; x <= n+1; x++) {
            prefix[0][x] = 1;
            sufix[301][x] = 1;
        }
//        cerr << col[prefix] << "\n";
        for (int c = 1; c <= 300; c++) {
            how_many[c][0] = 1;
            prefix[c][0] = 1;
            for (int x = 1; x <= n; x++) {
                how_many[c][x] = (dwu(ile[c], x) + how_many[c][x-1]) % mod;
                prefix[c][x] = prefix[c-1][x] * how_many[c][x] % mod;
            }
        }
        for (int c = 300; c >= 1; c--) {
            for (int x = 1; x <= n; x++) {
                sufix[c][x] = sufix[c+1][x] * how_many[c][x] % mod;
            }
        }
        for (int c = 1; c <= 300; c++) {
            for (int x = 1; x <= n; x++) {
                result[c][x] = exactly(c, x) * prefix[c-1][x-1] % mod * sufix[c+1][x] % mod;
//                if (c < 4)
//                    cerr << c << " " << x << " " << exactly(c, x) << " " << prefix[c-1][x-1] << " " << sufix[c+1][x] << "\n",
//                            cerr << c << " " << x << " " << result[c][x] << "\n";
//                res += result[c][x] * (x + 1) * (n - pref - 1) % mod;
                res += result[c][x] * (x + 1) % mod;
                res %= mod;
            }
        }
//        cerr << pref << " " << res << "\n\n";
    }
    cout << (res + n) % mod << "\n";
}