#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int maxn=100000;
const ll mod=998244353;

ll n;
pair<ll,ll> a[5][maxn+50];
ll pos[10];

int main(){
	ios_base::sync_with_stdio(false);
	cin >> n;
	for (int i=0;i<5;i++)
		for (int j=1;j<=n;j++){
			cin >> a[i][j].first;
			a[i][j].second=i;	
		}
	for (int i=0;i<5;i++) sort(a[i]+1,a[i]+n+1);
	
	ll ans=0;
	for (int i=0;i<5;i++){
		for (int j=1;j<=n;j++){
			for (int k=0;k<5;k++){
				if (k==i) continue;
				pos[k]=upper_bound(a[k]+1,a[k]+n+1,a[i][j])-a[k]-1;
			}
			/*
			cerr << "-------------" << endl;
			cerr << "i,j : " << i << " " << j << endl;
			for (int k=0;k<5;k++) cerr << pos[k] << " ";
			cerr << endl;
			*/
			for (int mask=0;mask<(1<<5);mask++){
				if ((mask>>i)&1) continue;
				if (__builtin_popcount(mask)!=2) continue;
				ll now=a[i][j].first;
				for (int k=0;k<5;k++) if (k!=i){
					if ((mask>>k)&1) now=now*pos[k]%mod;
					else now=now*(n-pos[k])%mod;
				}
				ans=(ans+now)%mod;
			}
			for (int k=0;k<5;k++) pos[k]=0;
		}
	}
	cout << ans << "\n";
	return 0;	
}