#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
using namespace std;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
    while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
const int N=405,M = 2200,P = 998244353,inf = 114514;
int n,cnt[N],fac[N],ifac[N];
int C(int n,int m){return 1ll * fac[n] * ifac[m] % P * ifac[n-m] % P;}
int fpow(int x,int y = P - 2){
    int res = 1;
    while(y){
        if(y & 1)res = 1ll * res * x % P;
        y >>= 1;
        x = 1ll * x * x % P;
    }
    return res;
}
void add(int &x,const ll y){x += y;if(x > P)x -= P;}
void Max(int &x,int y){if(x < y)x = y;}
struct Matrix{
    int f[3][3];
    void clear(){rep(i,0,2)rep(j,0,2)f[i][j] = -1;}
};
Matrix operator + (Matrix A,int x){
    Matrix res;res.clear();
    rep(i,0,2)rep(j,0,2)if(A.f[i][j] != -1){
        rep(k,0,2)if(x >= i + j + k)
            Max(res.f[j][k],min(A.f[i][j] + i + (x-i-j-k) / 3,4));
    }
    return res;
}
void MMax(Matrix &A,Matrix B){
    rep(i,0,2)rep(j,0,2)Max(A.f[i][j],B.f[i][j]);
}
struct node{
    int cnt;
    Matrix dp[2];
    void clear(){cnt = 0;dp[0].clear(),dp[1].clear();}
    bool operator <(const node &u)const{
        rep(t,0,1)rep(i,0,2)rep(j,0,2)
            if(dp[t].f[i][j] ^ u.dp[t].f[i][j])return dp[t].f[i][j] < u.dp[t].f[i][j];
        return cnt < u.cnt;
    }
};
bool Hu(node u){
    if(u.cnt >= 7)return 1;
    rep(i,0,2)rep(j,0,2)if(u.dp[1].f[i][j] >= 4)return 1;
    return 0;
}
node operator + (node u,int x){
    if(u.cnt == inf)return u;
    node res;res.clear();
    res.cnt = u.cnt + (x >= 2);
    rep(t,0,1)MMax(res.dp[t],u.dp[t] + x);
    if(x >= 2)MMax(res.dp[1],u.dp[0] + (x - 2));
    if(Hu(res)){
        res.clear();res.cnt = inf;
    }
    return res;
}
int G[M][5],dp[2][N][M],tot,ans,Winn;
map <node,int> mp;
queue <node> q;
void ins(node u){mp[u] = ++tot,q.push(u);}
void bfs(){
    node s;s.clear();
    s.dp[0].f[0][0] = 0;
    ins(s);
    while(!q.empty()){
        node u = q.front();q.pop();
        int id = mp[u];
        rep(i,0,4){
            node v = u + i;
            if(!mp.count(v)){
                ins(v);
                if(v.cnt == inf)Winn = tot;
            }
            G[id][i] = mp[v];
        }
    }
}
int main(){
    bfs();
    n = read();
    fac[0] = 1;
    rep(i,1,4*n)fac[i] = 1ll * fac[i-1] * i % P;
    ifac[4*n] = fpow(fac[4*n]);
    per(i,4*n,1)ifac[i-1] = 1ll * ifac[i] * i % P;
    rep(i,1,13){
        int x = read(),y = read();
        cnt[x]++;
    }
    dp[0][0][1] = 1;
    rep(i,1,n){
        int now = (i&1);
        memset(dp[now],0,sizeof(dp[now]));
        rep(j,1,tot)rep(k,0,(i-1)*4)rep(c,0,4-cnt[i]){
            add(dp[now][k+c][G[j][c+cnt[i]]],1ll * dp[now^1][k][j] * C(4 - cnt[i],c) % P);
        }
    }
    rep(i,0,4*n-13)rep(j,1,tot)if(j != Winn){
        add(ans,1ll * dp[n & 1][i][j] * fpow(C(4*n-13,i)) % P);
    }
    cout << ans << '\n';
    return 0;
}