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

namespace FastIO
{

class FastIOBase
{
 protected:
#ifdef OPENIOBUF
	static const int BUFSIZE=1<<16;
	char buf[BUFSIZE+1];
	int buf_p=0;
#endif
	FILE *target;
	FastIOBase(FILE *f): target(f){}
	~FastIOBase()=default;
 public:
#ifdef OPENIOBUF
	virtual void flush()=0;
#endif
};

class FastOutput final: public FastIOBase
{
 private:
	void __putc(char x)
	{
#ifdef OPENIOBUF
		if(buf[buf_p++]=x,buf_p==BUFSIZE) flush();
#else
		putc(x,target);
#endif
	}
	template<typename T>
	void __write(T x)
	{
		char stk[64],*top=stk;
		if(x<0) return __putc('-'),__write(-x);
		do *(top++)=x%10,x/=10; while(x);
		for(;top!=stk;__putc(*(--top)+'0'));
	}
 public:
	FastOutput(FILE *f=stdout): FastIOBase(f) {}
#ifdef OPENIOBUF
	~FastOutput() { flush(); }
	void flush() { fwrite(buf,1,buf_p,target),buf_p=0; }
#endif
	FastOutput &operator <<(char x)
	{ return __putc(x),*this; }
	FastOutput &operator <<(const char *s)
	{ for(;*s;__putc(*(s++)));return *this; }
	FastOutput &operator <<(const std::string &s)
	{ return (*this)<<s.c_str(); }
	template<typename T>
	std::enable_if_t<std::is_integral<T>::value,FastOutput&> operator <<(const T &x)
	{ return __write(x),*this; }
	template<typename ...T>
	void writesp(const T &...x)
	{ std::initializer_list<int>{(this->operator<<(x),__putc(' '),0)...}; }
	template<typename ...T>
	void writeln(const T &...x)
	{ std::initializer_list<int>{(this->operator<<(x),__putc('\n'),0)...}; }
	template<typename Iter>
	void writesp(Iter begin,Iter end)
	{ while(begin!=end) (*this)<<*(begin++)<<' '; }
	template<typename Iter>
	void writeln(Iter begin,Iter end)
	{ while(begin!=end) (*this)<<*(begin++)<<'\n'; }
}qout;

class FastInput final: public FastIOBase
{
 private:
	bool __eof;
 public:
	FastInput(FILE *f=stdin): FastIOBase(f),__eof(false)
#ifdef OPENIOBUF
	{ buf_p=BUFSIZE; }
	void flush() { buf[fread(buf,1,BUFSIZE,target)]=EOF,buf_p=0; }
	bool eof()const { return buf[buf_p]==EOF; }
#else
	{}
	bool eof()const { return feof(target); }
#endif
	char get()
	{
		if(__eof) return EOF;
#ifdef OPENIOBUF
		if(buf_p==BUFSIZE) flush();
		char ch=buf[buf_p++];
#else
		char ch=getc(target);
#endif
		return ~ch?ch:(__eof=true,EOF);
	}
	void unget(char c)
	{
		__eof=false;
#ifdef OPENIOBUF
		buf_p--;
#else
		ungetc(c,target);
#endif
	}
	explicit operator bool()const { return !__eof; }
	FastInput &operator >>(char &x)
	{ while(isspace(x=get()));return *this; }
	template<typename T>
	std::enable_if_t<std::is_integral<T>::value,FastInput&> operator >>(T &x)
	{
		char ch,sym=0;x=0;
		while(isspace(ch=get()));
		if(__eof) return *this;
		if(ch=='-') sym=1,ch=get();
		for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=get());
		return unget(ch),sym?x=-x:x,*this;
	}
	FastInput &operator >>(char *s)
	{
		while(isspace(*s=get()));
		if(__eof) return *this;
		for(;!isspace(*s) && !__eof;*(++s)=get());
		return unget(*s),*s='\0',*this;
	}
	FastInput &operator >>(std::string &s)
	{
		char str_buf[(1<<8)+1]={0},*p=str_buf;
		char *const buf_end=str_buf+(1<<8);
		while(isspace(*p=get()));
		if(__eof) return *this;
		for(s.clear(),p++;;p=str_buf)
		{
			for(;p!=buf_end && !isspace(*p=get()) && !__eof;p++);
			if(p!=buf_end) break;
			s.append(str_buf);
		}
		unget(*p),*p='\0',s.append(str_buf);
		return *this;
	}
	template<typename ...T>
	void read(T &...x)
	{ std::initializer_list<int>{(this->operator>>(x),0)...}; }
	template<typename Iter>
	void read(Iter begin,Iter end)
	{ while(begin!=end) (*this)>>*(begin++); }
}qin;

} // namespace FastIO
using FastIO::qin,FastIO::qout;

using LL=long long;
using LD=long double;
using UI=unsigned int;
using ULL=unsigned long long;
constexpr int INF=1e9;

#ifndef DADALZY
#define FILEIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
#define LOG(...) void()
#else
#define FILEIO(file)
#define LOG(...) fprintf(stderr,__VA_ARGS__)
#endif

namespace Math
{

template<typename Derived>
class ModintBase
{
 protected:
	int val;
 private:
	template<typename T>
	constexpr enable_if_t<is_integral<T>::value,T> __inv(T a,T b)const
	{ T x=0,y=1,t=0;for(;a;t=b/a,std::swap(a,b-=t*a),std::swap(y,x-=t*y));return x; }
	template<typename T>
	constexpr enable_if_t<is_integral<T>::value,T> __fix(T x)const
	{ return static_cast<const Derived*>(this)->fix(x); }
	constexpr static ModintBase __unfixed(int x)
	{ return reinterpret_cast<ModintBase&>(x); }
#define DEF_OP1(op) \
	friend constexpr ModintBase operator op(const ModintBase &lhs,const ModintBase &rhs)\
	{ return ModintBase(lhs)op##=rhs; }\
	ModintBase &operator op##=(const ModintBase &rhs)
#define DEF_OP2(op) \
	constexpr ModintBase  operator op(int)\
	{ ModintBase res(*this);return op(*this),res; }\
	constexpr ModintBase &operator op()
#define DEF_OP3(op) \
	constexpr ModintBase operator op()const
#define DEF_OP4(op) \
	friend constexpr bool operator op(const ModintBase &lhs,const ModintBase &rhs) \
	{ return lhs.val op rhs.val; }
#define MOD static_cast<const Derived*>(this)->getMod()
 public:
	constexpr ModintBase(): val(0) {}
	template<typename T>
	constexpr ModintBase(const T &x): val(__fix(x)) {}
	constexpr int operator ()()const { return val; }
	DEF_OP1(+) { return (val+=rhs.val)>=MOD?val-=MOD:0,*this; }
	DEF_OP1(-) { return (val-=rhs.val)<0?val+=MOD:0,*this; }
	DEF_OP1(*) { return val=__fix(1ll*val*rhs.val),*this; }
	DEF_OP1(/) { return val=__fix(1ll*val*__inv(rhs.val,MOD)),*this; }
	DEF_OP2(++) { return (++val)>=MOD?val-=MOD:0,*this; }
	DEF_OP2(--) { return (--val)<0?val+=MOD:0,*this; }
	DEF_OP3(+) { return *this; }
	DEF_OP3(-) { return __unfixed(val?MOD-val:0); }
	DEF_OP4(==) DEF_OP4(!=) DEF_OP4(<) DEF_OP4(>) DEF_OP4(<=) DEF_OP4(>=)
	constexpr ModintBase inv()const
	{ return ModintBase(__inv(val,MOD)); }
	template<typename T>
	friend inline constexpr enable_if_t<is_integral<T>::value,Derived> qpow(Derived x,T y)
	{ Derived res(1);for(;y;x*=x,y>>=1)if(y&1)res*=x;return res; }
#undef DEF_OP1
#undef DEF_OP2
#undef DEF_OP3
#undef DEF_OP4
#undef MOD
};

class FastMod
{
 private:
	using ULL=uint64_t;
	using U128=__uint128_t;
	ULL p,m;
 public:
	constexpr FastMod(): p(0),m(0) {}
	constexpr FastMod(ULL p): p(p),m((U128(1)<<64)/p) {}
	constexpr ULL getp()const { return p; }
	constexpr ULL operator()(ULL a)const
	{ ULL q=(U128(m)*a)>>64,r=a-q*p;return r>=p?r-p:r; }
};

// Modint for dynamic MOD
class DModint: public ModintBase<DModint>
{
 private:
	using BaseT=ModintBase<DModint>;
	static FastMod R;
	friend BaseT;
	template<typename T> static constexpr T fix(T x)
	{ return x<0?R.getp()-R(-x):R(x); }
 public:
	template<typename ...T>
	constexpr DModint(T ...x): BaseT(x...){}
	static constexpr void setMod(int mod) { R=FastMod(mod); }
	static constexpr int getMod() { return R.getp(); }
};
FastMod DModint::R{};

// Modint for static MOD
template<int MOD>
class SModint: public ModintBase<SModint<MOD>>
{
 private:
	using BaseT=ModintBase<SModint<MOD>>;
	friend BaseT;
	template<typename T> static constexpr T fix(T x)
	{ return (x%=MOD)<0?x+MOD:x; }
 public:
	template<typename ...T>
	constexpr SModint(T ...x): BaseT(x...) {}
	static constexpr int getMod() { return MOD; }
};

} // namespace Math

constexpr int MOD=998244353;
using Mint=Math::SModint<MOD>;

int T,n;
struct Rect{ int lx,rx,ly,ry; }a[100005];

int nx,ny,lshx[200005],lshy[200005];
inline int getx(int x)
{ return lower_bound(lshx+1,lshx+nx+1,x)-lshx; }
inline int gety(int y)
{ return lower_bound(lshy+1,lshy+ny+1,y)-lshy; }
inline Mint C2(Mint x)
{ return x*(x-1)/2; }
inline Mint C3(Mint x)
{ return x*(x-1)*(x-2)/6; }

struct TreeNode{ int mn;Mint sum; }t[800005];
#define LC (i<<1)
#define RC (i<<1|1)
void build(int l,int r,int i=1)
{
	t[i].mn=INF;
	t[i].sum=t[i].mn*Mint(lshy[r+1]-lshy[l]);
	if(l==r) return;
	int mid=(l+r)>>1;
	build(l,mid,LC),build(mid+1,r,RC);
}
Mint calc(int mn,int i,int l,int r)
{
	if(l==r) return min(mn,t[i].mn)*Mint(lshy[r+1]-lshy[l]);
	int mid=(l+r)>>1;
	if(mn<=t[RC].mn) return calc(mn,LC,l,mid)+mn*Mint(lshy[r+1]-lshy[mid+1]);
	else return t[i].sum+calc(mn,RC,mid+1,r);
}
void modify(int p,int x,int i=1,int l=1,int r=ny-1)
{
	if(l==r) return t[i].mn=x,void();
	int mid=(l+r)>>1;
	if(mid>=p) modify(p,x,LC,l,mid);
	else modify(p,x,RC,mid+1,r);
	t[i].mn=min(t[LC].mn,t[RC].mn);
	t[i].sum=calc(t[RC].mn,LC,l,mid);
}
Mint query(int lim,int rq)
{
	int cur=INF;
	Mint res;
	auto work=[&](auto &self,int i,int l,int r)
	{
		if(cur<lim) return;
		if(r<=rq && min(cur,t[i].mn)>=lim)
		{
			res+=calc(cur,i,l,r)-Mint(lshy[r+1]-lshy[l])*(lim-1);
			cur=min(cur,t[i].mn);
			return;
		}
		if(l>rq || l==r)
			return cur=min(cur,t[i].mn),void();
		int mid=(l+r)>>1;
		self(self,RC,mid+1,r);
		self(self,LC,l,mid);
	};
	work(work,1,1,ny-1);
	return res;
}

int ord1[100005],ord2[100005];
int llen[100005],rlen[100005];
multiset<int> mxl,mnr,ss[200005];
Mint subsolve1()
{
	int liml=nx,limr=0;
	for(int i=1,l=1,r=INF,j=1;i<nx;i++)
	{
		while(j<=n && a[ord2[j]].rx<lshx[i])
		{
			l=max(l,a[ord2[j]].lx);
			r=min(r,a[ord2[j]].rx);
			j++;
		}
		if(l>r) { liml=i;break; }
		llen[i]=(j>1?r-l+1:0);
	}
	for(int i=nx,l=1,r=INF,j=n;i>1;i--)
	{
		while(j>=1 && a[ord1[j]].lx>=lshx[i])
		{
			l=max(l,a[ord1[j]].lx);
			r=min(r,a[ord1[j]].rx);
			j--;
		}
		if(l>r) { limr=i-1;break; }
		rlen[i-1]=(j<n?r-l+1:0);
	}
	Mint res;
	for(int i=1;i<nx;i++)
	{
		if(i>=liml || i<=limr) continue;
		Mint len=lshx[i+1]-lshx[i],ld=lshx[i]-1,rd=INF-lshx[i+1]+1;
		if(llen[i] && rlen[i]) res+=len*llen[i]*rlen[i];
		else if(llen[i]) res+=llen[i]*C2(len)+rd*llen[i]*len;
		else if(rlen[i]) res+=rlen[i]*C2(len)+ld*rlen[i]*len;
		else res+=ld*rd*len+C2(len)*(ld+rd)+C3(len);
	}
	return res;
}
Mint subsolve2()
{
	mxl=multiset{1};
	mnr=multiset{INF};
	for(int i=1;i<ny;i++) ss[i]=multiset{INF};
	build(1,ny-1);
	auto add=[&](int l,int r)
	{
		int p=gety(l)-1;
		mxl.insert(l);
		mnr.insert(r);
		ss[p].insert(r);
		if(p>=1) modify(p,*ss[p].begin());
	};
	auto del=[&](int l,int r)
	{
		int p=gety(l)-1;
		mxl.erase(mxl.find(l));
		mnr.erase(mnr.find(r));
		ss[p].erase(ss[p].find(r));
		if(p>=1) modify(p,*ss[p].begin());
	};
	for(int i=1;i<=n;i++) add(a[i].ly,a[i].ry);
	Mint res;
	for(int i=1,j1=1,j2=1;i<nx;i++)
	{
		while(j1<=n && a[ord1[j1]].lx<lshx[i+1])
			del(a[ord1[j1]].ly,a[ord1[j1]].ry),j1++;
		while(j2<=n && a[ord2[j2]].rx<lshx[i])
			add(a[ord2[j2]].ly,a[ord2[j2]].ry),j2++;
		int l=*mxl.rbegin(),r=*mnr.begin(),len=lshx[i+1]-lshx[i];
		res+=len*query(l,gety(r+1)-1);
		if(l<=r) res-=len*((r-l+1)+C2(r-l+1));
	}
	return res;
}
Mint solve()
{
	nx=2,lshx[1]=1,lshx[2]=INF+1;
	ny=2,lshy[1]=1,lshy[2]=INF+1;
	for(int i=1;i<=n;i++)
	{
		lshx[++nx]=a[i].lx,lshx[++nx]=a[i].rx+1;
		lshy[++ny]=a[i].ly,lshy[++ny]=a[i].ry+1;
	}
	sort(lshx+1,lshx+nx+1);
	sort(lshy+1,lshy+ny+1);
	nx=unique(lshx+1,lshx+nx+1)-lshx-1;
	ny=unique(lshy+1,lshy+ny+1)-lshy-1;
	iota(ord1+1,ord1+n+1,1);
	iota(ord2+1,ord2+n+1,1);
	sort(ord1+1,ord1+n+1,[](int x,int y){ return a[x].lx<a[y].lx; });
	sort(ord2+1,ord2+n+1,[](int x,int y){ return a[x].rx<a[y].rx; });
	Mint res;
	res+=subsolve1();
	res+=subsolve2();
	return res;
}

int main()
{
	qin>>T;
	while(T--)
	{
		qin>>n;
		for(int i=1;i<=n;i++)
			qin>>a[i].lx>>a[i].ly>>a[i].rx>>a[i].ry;
		Mint ans;
		ans+=solve();
		for(int i=1;i<=n;i++)
			swap(a[i].lx,a[i].ly),swap(a[i].rx,a[i].ry);
		ans+=solve();
		qout<<ans()<<'\n';
	}
	return 0;
}