#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

const int MOD = 998244353;

void add(int &x, int val) {
    x += val;
    if (x >= MOD) x -= MOD;
}

pii arr[5][100005];
int cnt[5][5];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < 5; ++i)
        for (int j = 0; j < n; ++j)
            cin >> arr[i][j].X, arr[i][j].Y = i;
    int ans = 0;
    for (int i = 0; i < 5; ++i)
        sort(arr[i], arr[i] + n);
    for (int i = 0; i < 5; ++i)
        for (int j = 0; j < n; ++j) {
            for (int k = 0; k < 5; ++k)
                if (k != i) {
                    while (cnt[i][k] < n && arr[i][j] > arr[k][cnt[i][k]])
                        ++cnt[i][k];
                }
            for (int msk = 0; msk < (1 << 5); ++msk) {
                if (__builtin_popcount(msk) == 2 && (msk >> i & 1) == 0) {
                    int cur = arr[i][j].X;
                    for (int x = 0; x < 5; ++x)
                        if (x != i) {
                            if (msk >> x & 1) cur = (ll)cur * cnt[i][x] % MOD;
                            else cur = (ll)cur * (n - cnt[i][x]) % MOD;
                        }
                    add(ans, cur);
                }
            }
        }
    cout << ans << "\n";
}