#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<map>
#include<ctime>
#include<string>
using namespace std;
typedef long long LL;
const int INF=0x3f3f3f3f;
const LL inf=0x3f3f3f3f3f3f3f3fLL;
const double eps=1e-10;

struct Point{
	double x,y;
	Point(double xx=0,double yy=0) : x(xx),y(yy) {}
} p[2010],ch[2010];
typedef Point Vector;//定义向量 

Vector operator + (Vector a,Vector b) { return Vector(a.x+b.x,a.y+b.y); }
Vector operator - (Vector a,Vector b) { return Vector(a.x-b.x,a.y-b.y); }
Vector operator * (Vector a,Vector b) { return Vector(a.x*b.x,a.y*b.y); }
Vector operator / (Vector a,Vector b) { return Vector(a.x/b.x,a.y/b.y); }
bool operator < (const Point &a,const Point &b) { return a.x==b.x? a.y<b.y:a.x<b.x; }

int dcmp(double x)//精度判断 
{
	if(fabs(x)<eps) return 0;
	return x<0 ? -1 : 1;
}

double Dot(Vector a,Vector b) { return a.x*b.x+a.y*b.y; } //点积,向量积 
double Cross(Vector a,Vector b) { return a.x*b.y-a.y*b.x; }//叉积 
double Length(Vector a) { return sqrt(Dot(a,a)); }//向量长度
double Angle(Vector a,Vector b) { return acos(Dot(a,b)/Length(a)/Length(b)); }//向量的夹角
Vector Rotate(Vector a,double rad) { return Vector(a.x*cos(rad)-a.y*sin(rad),a.x*sin(rad)+a.y*cos(rad)); }//逆时针旋转rad
Vector Normal(Vector a){ return Vector(-a.y/Length(a),a.x/Length(a)); }//单位法向量
double torad(double deg) { return deg/180*acos(-1); }//角度转化为弧度
 
Point GetLineIntersection(Point p,Vector v,Point q,Vector w)//两直线交点 
{
	Vector u=p-q;
	double t=Cross(w,u)/Cross(v,w);
	return p+v*t;
}

double DistanceToLine(Point p,Point a,Vector b)//点到直线距离 
{
	Vector v1=b-a,v2=p-a;
	return fabs(Cross(v1,v2))/Length(v1);	
} 
/*
double DistanceToSegment(Point p,Point b)//点到线段距离 
{
	if(a==b) return Length(p-a);
	Vector v1=b-a,v2=p-a,v3=p-b;
	if(dcmp(Dot(v1,v2))<0) return Length(v2);
	else if(dcmp(Dot(v1,v3))>0) return Length(v3);
	else return fabs(Cross(v1,v2))/Length(v1);
}
*/
Point GetLineProjection(Point p,Point b)//点在直线的投影点 
{
	Vector v=b-a;
	return a+v*(Dot(v,p-a)/Dot(v,v));
}

double Polygonarea(Point *p,int n)//多边形面积(凸,凹) 
{
	double area=0;
	for(int i=1;i<n-1;i++) area+=Cross(p[i]-p[0],p[i+1]-p[0]);
	return area/2;
}

int Convexhull(Point *p,int n,Point *ch)//凸包 
{
	sort(p,p+n);
	int m=0;
	for(int i=0;i<n;i++)
	{
		while(m>1 && Cross(ch[m-1]-ch[m-2],p[i]-ch[m-2])<=0) m--;
		ch[m++]=p[i];
	}
	int k=m;
	for(int i=n-2;i>=0;i--)
	{
		while(m>k && Cross(ch[m-1]-ch[m-2],p[i]-ch[m-2])<=0) m--;
		ch[m++]=p[i];
	}
	if(n>1) m--;
	return m;
}

int N,n;
double x,j;

int main()
{
	scanf("%d",&N);
	while(N--)
	{
		int flag=0;
		double area1=0,area2=0;
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
		{
			scanf("%lf%lf%lf%lf%lf",&x,&y,&w,&h,&j);
			Point O{x,y};
			double rad=-torad(j);
			p[flag++]=O + Rotate(Vector(-w/2,-h/2),rad);
			p[flag++]=O + Rotate(Vector(w/2,rad);
			p[flag++]=O + Rotate(Vector(-w/2,h/2),rad);
			area1+=w*h;
		}
		int cnt=Convexhull(p,flag,ch);
		area2=Polygonarea(ch,cnt);
		printf("%.1lf %%n",area1*100/area2);
	}
	return 0;
}