#include<bits/stdc++.h>
using namespace std;
#define pb push_back
const int mod=998244353,I=1e9;
const int inv2=(mod+1)/2,inv6=(mod+1)/6;
int C(int a,int b){
    if(a>=mod)a-=mod;
    if(b==0)return 1;
    if(b==1)return a;
    if(b==2)return 1ll*a*(a-1)%mod*inv2%mod;
    if(b==3)return 1ll*a*(a-1)%mod*(a-2)%mod*inv6%mod;
    return 0;
}
int M(int x){if(x>=mod)x-=mod;return x;}
void ad(int &x,int y){x+=y;if(x>=mod)x-=mod;}
const int N=2e5+10;
int n,ans,xl[N],xr[N],qc[200100],yl[N],yr[N],cn;
int Fx(int x){return lower_bound(qc+1,qc+cn+1,x)-qc;}
int R[N],dp[N][4];
void sol3(){
    dp[0][0]=1;
    int ts[4]={1,0,0,0};
    for(int i=1;i<=cn;i++)R[i]=max(R[i],R[i-1]);
    for(int i=1;i<=cn;i++){
        for(int j=R[i-1];j<R[i];j++)for(int o=0;o<=3;o++)
        ad(ts[o],mod-dp[j][o]);
        if(i==cn){ad(ans,ts[3]);break;}
        for(int o=0;o<=3;o++)dp[i][o]=0;
        for(int o=1;o<=3;o++)for(int j=0;o+j<=3;j++)
            ad(dp[i][o+j],1ll*ts[j]*C(qc[i+1]-qc[i],o)%mod);
        for(int o=0;o<=3;o++)ad(ts[o],dp[i][o]);
    }
}
multiset<int>sl,sr;
//对于x<l,必须取y<=r
multiset<int>xp[N];
struct SGT{
    int mi[N<<2],su[N<<2],le[N<<2];
    bool lf[N<<2];
    inline void build(int p,int l,int r){
        mi[p]=I,lf[p]=0;
        if(l==r){
            le[p]=M(qc[l]-qc[l-1]);
            su[p]=1ll*le[p]*I%mod,lf[p]=1;
            return;
        }
        int mid=(l+r)>>1;
        build(p<<1,l,mid),build(p<<1|1,mid+1,r);
        le[p]=M(le[p<<1]+le[p<<1|1]),su[p]=M(su[p<<1]+su[p<<1|1]);
    }
    //最后一个<z位置
    inline int fig(int p,int l,int r,int z){
        if(mi[p]>=z)return 1;
        if(l==r)return l;
        int mid=(l+r)>>1;
        if(mi[p<<1|1]<z)return fig(p<<1|1,mid+1,r,z);
        return fig(p<<1,l,mid,z);
    }
    inline int as(int p,int z){
        if(lf[p])return 1ll*le[p]*min(z,mi[p])%mod;
        if(z>mi[p<<1|1])return M(M(su[p]+mod-su[p<<1|1])+as(p<<1|1,z));
        return M(as(p<<1,z)+1ll*z*le[p<<1|1]%mod);
    }
    inline void sc(int p){
        mi[p]=min(mi[p<<1],mi[p<<1|1]);
        su[p]=M(su[p<<1|1]+as(p<<1,mi[p<<1|1]));
    }
    inline void up(int p,int l,int r,int x){
        if(l==r){
            if(!xp[l].empty())mi[p]=*xp[l].begin();
            else mi[p]=I;
            su[p]=1ll*mi[p]*le[p]%mod;
            return;
        }
        int mid=(l+r)>>1;if(x<=mid)up(p<<1,l,mid,x);else up(p<<1|1,mid+1,r,x);
        sc(p);
    }
    int fz,sk;
    void doi(int p){ad(sk,as(p,fz)),fz=min(fz,mi[p]);}
    inline void ask(int p,int l,int r,int x){
        if(x==l){doi(p);return;}
        int mid=(l+r)>>1;
        if(x>mid)ask(p<<1|1,mid+1,r,x);
        else doi(p<<1|1),ask(p<<1,l,mid,x);
    }
}A;
void del(int l,int r){
    assert(!sl.empty());
    assert(sl.find(l)!=sl.end());
    assert(sr.find(r)!=sr.end());
    sl.erase(sl.find(l)),sr.erase(sr.find(r));
    int kl=Fx(l-1);
    xp[kl].erase(xp[kl].find(r));
    if(kl>1)A.up(1,2,cn,kl);
}
void ins(int l,int r){
    sl.insert(l),sr.insert(r);
    int kl=Fx(l-1);
    xp[kl].insert(r);
    if(kl>1)A.up(1,2,cn,kl);
}
int calc(){
    if(sl.empty())return C(I,2);
    int L=*sr.begin(),R=*(--sl.end());
    int su=0,o=I;
    int pl=A.fig(1,2,cn,R)+1,pr=Fx(L);
    if(pl>pr)return 0;
    A.fz=I,A.sk=0,A.ask(1,2,cn,pl),ad(su,A.sk);
    if(pr<cn)A.fz=I,A.sk=0,A.ask(1,2,cn,pr+1),ad(su,mod-A.sk);
    ad(su,mod-1ll*(qc[pr]-qc[pl-1])*(R-1)%mod);
    if(L>=R)ad(su,mod-C(L-R+2,2));
    return su;
}
void sol2(){
    cn=0;qc[++cn]=I;qc[++cn]=0;
    for(int i=1;i<=n;i++)qc[++cn]=yl[i]-1,qc[++cn]=yr[i];
    sort(qc+1,qc+cn+1);cn=unique(qc+1,qc+cn+1)-qc-1;
    for(int i=1;i<=cn;i++)xp[i].clear();
    vector<array<int,3> >zp;
    zp.pb({1,0,0});
    sl.clear(),sr.clear();
    for(int i=1;i<=n;i++)zp.pb({1,1,i}),zp.pb({xl[i],2,i}),zp.pb({xr[i]+1,1,i});
    sort(zp.begin(),zp.end());
    A.build(1,2,cn);
    for(int o=0;o<zp.size();o++){
        int u=zp[o][2],t=zp[o][1];
        if(t==2)del(yl[u],yr[u]);
        if(t==1)ins(yl[u],yr[u]);
        int he=(o+1==zp.size())?(I-zp[o][0]+1):(zp[o+1][0]-zp[o][0]);
        if(he)ad(ans,1ll*calc()*he%mod);
    }
}
void sol(){
    cn=0;qc[++cn]=1,qc[++cn]=I+1;
    for(int i=1;i<=n;i++)qc[++cn]=xl[i],qc[++cn]=xr[i]+1;
    sort(qc+1,qc+cn+1);cn=unique(qc+1,qc+cn+1)-qc-1;
    for(int i=1;i<=cn;i++)R[i]=0;
    for(int i=1;i<=n;i++){
        int kl=Fx(xl[i]),kr=Fx(xr[i]+1);
        R[kr]=max(R[kr],kl);
    }
    sol3();sol2();
}
int main(){
    int T;scanf("%d",&T);while(T--){
        scanf("%d",&n),ans=0;
        for(int i=1;i<=n;i++)scanf("%d%d%d%d",&xl[i],&yl[i],&xr[i],&yr[i]);
        sol();for(int i=1;i<=n;i++)swap(xl[i],yl[i]),swap(xr[i],yr[i]);sol();
        printf("%d\n",(ans+mod)%mod);
    }
    return 0;
}