#include <iostream>

 #include <cstdio>

 #include <algorithm>

 using namespace std;

 int main()

 {

     int n, i, j, k, cases;

     double area, x[], y[], r[], dx[*], dy[*];

     cases = ;

     while(cin>>n && n)

     {

         for(i=; i<n; i++)

         {

             cin >> x[i] >> y[i] >> r[i];

             dx[i*] = x[i] - r[i], dx[i*+] = x[i] + r[i];

             dy[i*] = y[i] - r[i], dy[i*+] = y[i] + r[i];

         }

         sort(dx, dx+*n);

         sort(dy, dy+*n);

         area = 0.0;

         for(i = ; i < *n; i++)

             for(j = ; j < *n; j++)

                 for(k = ; k < n; k++)

                 {

                     if(dx[i-]>=x[k]-r[k] && dx[i]<=x[k]+r[k])

                         if(dy[j-]>=y[k]-r[k] && dy[j]<=y[k]+r[k])

                         {

                             area += (dx[i] - dx[i-]) * (dy[j] - dy[j-]);

                             break;

                         }

                 }

         printf("%d %.2lf\n", ++cases, area);

     }

     return ;

 }