#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int mod = 127237991;

int n;
vector<vector<int>> a(5);
vector<vector<long long>> memo(5, vector<long long>(1000, 1));
vector<vector<bool>> visit(5, vector<bool>(1000, false));

long long f(int x, int y) {
    if (visit[x][y]) return memo[x][y];
    if (x == 4) return 1;
    int m = upper_bound(a[x + 1].begin(), a[x + 1].end(), a[x][y]) - a[x + 1].begin();
    if (m == n) return 0;
    long long cnt = 0;
    for (int i = m; i < n; i++) {
        cnt += f(x + 1, i);
        cnt %= mod;
    }
    memo[x][y] = cnt;
    visit[x][y] = true;
    return memo[x][y];
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n;
    for (int i = 0; i < 5; i++) {
        a[i].resize(n);
        for (int j = 0; j < n; j++) {
            cin >> a[i][j];
        }
        sort(a[i].begin(), a[i].end());
    }

    long long ans = 0;
    for (int i = 0; i < n; i++) {
        ans += f(0, i) % mod;
        ans %= mod;
    }

    cout << ans << endl;

    return 0;
}