#include <vector>
#include "math.h"

const double eps=.001;

vector< vector <int> > ind;
vector< vector <double> > cor;
const int large=100000000; 
double xmin=large,xmax=-large,ymin=large,ymax=-large;
vector<double> zpp,zpm,zmp,zmm;

void readin() {
  vector <int> ind1; 
  vector <double> cor1; 
  int idx; 
  while (cin >> idx) {
     ind1.clear();
     ind1.push_back(idx);
     for (int i=0; i<6 ;i++) {
       int a;
       cin >> a;  
       ind1.push_back(a);
     }
     ind.push_back(ind1);
     cor1.clear();
     double x,y,z;
     cin >> x >> y >> z;
     if (x<xmin) xmin=x;
     if (y<ymin) ymin=y;
     if (x>xmax) xmax=x;
     if (y>ymax) ymax=y;
     cor1.push_back(x);
     cor1.push_back(y);
     cor1.push_back(z);
     cor.push_back(cor1);
  }
//  cout << "Points: " << ind.size() << "\n";
//  cout << "limits: " << xmin << ' ' << xmax << ' ' << ymin << ' ' << ymax << "\n";
}

double xnew(double xold) {
return(xold-xmin-(xmax-xmin)/2.0);
}

double ynew(double yold) {
return(yold-ymin-(ymax-ymin)/2.0);
}

/*
double yold(double ynew) {
return(ynew+(ymax-ymin)/2.0);
}

double xold(double xnew) {
return(xnew+(xmax-xmin)/2.0);
}
*/

bool eq(double x, double y) {
 if (fabs(x-y)<eps) return 1;
 return 0;
}

void  findmirrors(double x,double y, int &mpid,int & mmid, int &pmid) {
 int notdone=3;
 x=xnew(x);
 y=ynew(y);
 for (int i=0; i<ind.size();i++) {
    double nx=cor[i][0];
    double ny=cor[i][1];

    nx=xnew(nx);
    ny=ynew(ny);
//    cout << x << ' ' << y  << ' ' << nx << ' ' << ny << ' ';
 
    if (eq(nx,-x) && eq(ny,y) ) {
      mpid=i;
      notdone--;
    }
    if (eq(nx,-x) && eq(ny,-y) ) {
      mmid=i;
      notdone--;
    }
    if (eq(nx,x) && eq(ny,-y) ) {
      pmid=i;
      notdone--;
    }
//    cout << notdone << "\n";
    if (notdone == 0) return;
 } 
 if (notdone) {
     cout << "Did not find points " << notdone << ' ' << x << ' ' << y <<"\n";
     exit(1);
 }
}

void findit() {
cout << "==>";
for (int i=0;i<ind.size();i++) {
  if (eq(xnew(cor[i][0]),0.0) && eq(ynew(cor[i][1]),0.0) ) {
    cout << "==>" << cor[i][0];
  }
}
}


main() {
cout.precision(20);
int mpid,mmid,pmid;
double npp=0, npm=0, nmm=0, nmp=0;
readin();
for (int i=0;i<ind.size();i++) {
  findmirrors(cor[i][0],cor[i][1],mpid,mmid,pmid);
  double
  z=(cor[i][2] + cor[mpid][2] + cor[pmid][2] + cor[mmid][2])/4;
  zpp.push_back(z);  
  npp += z*z;

  z=(cor[i][2] + cor[mpid][2] - cor[pmid][2] - cor[mmid][2])/4;
  zpm.push_back(z);  
  npm += z*z;

  z=(cor[i][2] - cor[mpid][2] - cor[pmid][2] + cor[mmid][2])/4;
  zmm.push_back(z);  
  nmm += z*z;

  z=(cor[i][2] - cor[mpid][2] + cor[pmid][2] - cor[mmid][2])/4;
  zmp.push_back(z);  
  nmp += z*z;
}

int whic=0;
double nm=npp;
if (npm>nm) {
   whic=1;
   nm=npm;
}
if (nmm>nm) {
   whic=2;
   nm=nmm;
}
if (nmp>nm) {
   whic=3;
   nm=nmp;
}


for (int i=0;i<ind.size();i++) {
  for (int j=0;j<7;j++) {
    cout << ind[i][j] << ' '; 
  }
  for (int j=0;j<2;j++) {
    cout << cor[i][j] << ' '; 
  }
  double nm=max(npp,npm);
  if (whic == 0) cout << zpp[i];
  else if (whic == 1) cout << zpm[i];
  else if (whic == 2) cout << zmm[i];
  else cout << zmp[i];
  cout << "\n";
}
}