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

struct circle{
    double x,y,r;
};

double dis2(double x1,double y1,double x2,double y2){
    return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}

ll n;
circle C[509],c[509];
bool intersect(double& x1,double& y1,double& x2,double& y2,circle &c){
    if(dis2(x1,y1,c.x,c.y)<c.r*c.r)return 1;
    if(dis2(x2,y1,c.x,c.y)<c.r*c.r)return 1;
    if(dis2(x1,y2,c.x,c.y)<c.r*c.r)return 1;
    if(dis2(x2,y2,c.x,c.y)<c.r*c.r)return 1;
    if(c.y>=min(y1,y2)&&c.y<=max(y1,y2)){
        if(min(abs(c.x-x1),abs(c.x-x2))<c.r) return 1;
    }
    if(c.x>=min(x1,x2)&&c.x<=max(x1,x2)){
        if(min(abs(c.y-y1),abs(c.y-y2))<c.r) return 1;
    }
    if(c.y>=min(y1,y2)&&c.y<=max(y1,y2)&&c.x>=min(x1,x2)&&c.x<=max(x1,x2)) return 1;
    return 0;
}

bool cover(double& x1,double& y1,double& x2,double& y2,circle& c){
    if(dis2(x1,y1,c.x,c.y)<=c.r*c.r&&dis2(x2,y1,c.x,c.y)<=c.r*c.r&&dis2(x1,y2,c.x,c.y)<=c.r*c.r&&dis2(x2,y2,c.x,c.y)<=c.r*c.r) return 1;
    return 0;
}
int checkI(double &x1,double &y1,double &x2,double &y2,int i){
    if(!intersect(x1,y1,x2,y2,C[i])) return 0;
    if(cover(x1,y1,x2,y2,c[i])) return 0;
    if(intersect(x1,y1,x2,y2,c[i])) return 1;
    if(cover(x1,y1,x2,y2,C[i])) return 2;
    return 1;
}

mt19937_64 gen(time(NULL));

void solve(){
    cin>>n;
    for(ll i=1;i<=n;i++){
        cin>>C[i].x>>C[i].y>>C[i].r;
        cin>>c[i].x>>c[i].y>>c[i].r;
    }
    stack<pair<pair<double,double>,double>> q;
    q.emplace(make_pair(-1200,-1200),2400);
    double ans=0;
    while(!q.empty()){
        double x1=q.top().first.first,y1=q.top().first.second;
        double r=q.top().second;
        double x2=x1+r,y2=y1+r;
        q.pop();
        if(r*r<2e-3) {
            uniform_real_distribution<double> dx(x1,x2);
            uniform_real_distribution<double> dy(y1,y2);
            int cnt=0;
            for(int i=0;i<10;i++){
                double x=dx(gen);
                double y=dy(gen);
                int ok=0;
                for(ll i=1;i<=n;i++){
                    ok=max(ok,checkI(x,y,x,y,i));
                }
                if(ok==2)cnt++;
            }
            ans+=(x2-x1)*(y2-y1)/10*cnt;
            continue;
        }
        int ok=0;
        for(ll i=1;i<=n;i++){
            ok=max(ok,checkI(x1,y1,x2,y2,i));
        }
        if(ok==0) continue;
        if(ok==2){
            ans+=r*r;
            continue;
        }
        double midx=(x1+x2)/2.0,midy=(y1+y2)/2.0;
        q.emplace(make_pair(x1,y1),r/2.0);
        q.emplace(make_pair(x1,midy),r/2.0);
        q.emplace(make_pair(midx,midy),r/2.0);
        q.emplace(make_pair(midx,y1),r/2.0);
    }
    cout<<fixed<<setprecision(6)<<ans<<'\n';
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n=1;
    cin>>n;
    while(n--)solve();
    return 0;
}