#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 p_inner(double x1,double y1,circle &c){
  if(dis2(x1,y1,c.x,c.y) <c.r*c.r) return 1;
  return 0;
}
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;
}

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<1e-5){
      int ok=0;
      for(int i=1;i<=n;i++){
        if(p_inner(x1+r/2.0,y1+r/2.0,C[i])&&!p_inner(x1+r/2.0,y1+r/2.0,c[i])){
          ok=1;
          break;
        }
      }
      if(ok) ans+=r*r;

      continue;
    }

    int ok=0;
    for(int i=1;i<=n;i++){
      ok=max(ok,checkI(x1,y1,x2,y2,i));
      if(ok==2) break;
    }

    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;
}