#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <queue>
#include <stack>
#include <functional>
#include <map>
#include <set>
#include <bitset>
#include <ctime>
#include <cassert>
#include <complex>

const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3fll;
#define memset0(x) memset(x, 0, sizeof(x))
#define memsetM1(x) memset(x, -1, sizeof(x))
#define memsetINF(x) memset(x, INF, sizeof(x))

using namespace std;

const int MAXN = 1e5 + 5;
using ll = long long;
const ll MOD = 998244353;
int arr[5][MAXN];
int n;

ll cal(int a, int b, int c, int d)
{
	return (ll)a * b % MOD * (n - c) % MOD * (n - d) % MOD;
}

int main()
{

	scanf("%d", &n);
	for (int i = 0; i < 5; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			scanf("%d", &arr[i][j]);
		}
		sort(arr[i] + 1, arr[i] + 1 + n);
	}
	ll ans = 0;
	for (int i = 0; i < 5; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			int cnt[4];
			int cnt2[4];
			int ind = 0;
			ll cans = 0;
			for (int k = 0; k < 5; k++)
			{
				if (k == i)
				{
					continue;
				}
				int ccnt = (upper_bound(arr[k] + 1, arr[k] + 1 + n, arr[i][j]) - arr[k]) - 1;
				int ccnt2 = (lower_bound(arr[k] + 1, arr[k] + 1 + n, arr[i][j]) - arr[k]) - 1;
				cnt2[ind] = ccnt - ccnt2;
				cnt[ind++] = ccnt;
			}

			if (i == 1)
			{
				cnt[0] -= cnt2[0];
			}
			else if (i == 2)
			{
				cnt[0] -= cnt2[0];
				cnt[1] -= cnt2[1];
			}
			else if (i == 3)
			{
				cnt[0] -= cnt2[0];
				cnt[1] -= cnt2[1];
				cnt[2] -= cnt2[2];
			}
			else if (i == 4)
			{
				cnt[0] -= cnt2[0];
				cnt[1] -= cnt2[1];
				cnt[2] -= cnt2[2];
				cnt[3] -= cnt2[3];
			}
			cans = (cans + cal(cnt[0], cnt[1], cnt[2], cnt[3])) % MOD;
			cans = (cans + cal(cnt[0], cnt[2], cnt[1], cnt[3])) % MOD;
			cans = (cans + cal(cnt[0], cnt[3], cnt[1], cnt[2])) % MOD;
			cans = (cans + cal(cnt[1], cnt[2], cnt[0], cnt[3])) % MOD;
			cans = (cans + cal(cnt[1], cnt[3], cnt[0], cnt[2])) % MOD;
			cans = (cans + cal(cnt[2], cnt[3], cnt[0], cnt[1])) % MOD;
			
			ans = (ans + cans * arr[i][j] % MOD) % MOD;
		}
	}
	cout << ans << endl;

	return 0;
}