// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
  int x;
  modint(int o=0){x=o;}
  modint &operator = (int o){return x=o,*this;}
  modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
  modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
  modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
  modint &operator ^=(int b){
    modint a=*this,c=1;
    for(;b;b>>=1,a*=a)if(b&1)c*=a;
    return x=c.x,*this;
  }
  modint &operator /=(modint o){return *this *=o^=mod-2;}
  friend modint operator +(modint a,modint b){return a+=b;}
  friend modint operator -(modint a,modint b){return a-=b;}
  friend modint operator *(modint a,modint b){return a*=b;}
  friend modint operator /(modint a,modint b){return a/=b;}
  friend modint operator ^(modint a,int b){return a^=b;}
  friend bool operator ==(modint a,modint b){return a.x==b.x;}
  friend bool operator !=(modint a,modint b){return a.x!=b.x;}
  bool operator ! () {return !x;}
  modint operator - () {return x?mod-x:0;}
  bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
  if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
  int m=iv.size(); ++n;
  if(m>=n)return;
  iv.resize(n),fac.resize(n),ifac.resize(n);
  For(i,m,n-1){
    iv[i]=iv[mod%i]*(mod-mod/i);
    fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
  }
}
inline modint C(int n,int m){
  if(m<0||n<m)return 0;
  return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 400005
#define inf 0x3f3f3f3f

const double eps=0.1;
int n;
double d[13][13];
double x[13],y[13],z[13];

std::mt19937_64 rnd(std::chrono::steady_clock::now().time_since_epoch().count());

const ull U=-1;
double R(){
  return 1.0*rnd()/U;
}

int q[maxn],m;
double d2[13][13];
double sum;

void calc(){
  sum=0;
  For(i,1,n)For(j,i+1,n){
    d2[i][j]=d2[j][i]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]));
    sum+=fabs(d2[i][j]-d[i][j])*fabs(d2[i][j]-d[i][j]);
  }
}

bool chk(){
  calc();
  m=0;
  For(i,1,n){
    bool ok=1;
    For(j,1,n){
      double t=fabs(d2[i][j]-d[i][j]);
      if(t>eps) ok=0;
    }
    if(!ok) q[++m]=i;
  }
  return m==0;
}

double R(double l,double r){
  l=max(l,0.0);
  r=min(r,1.0);
  double t=R();
  t*=(r-l);
  t+=l;
  return t;
}

void work(){
  int cnt=0;
  int V=10000;
  
  For(i,1,n)x[i]=R(),y[i]=R(),z[i]=R();
  
  double t=1;
  while(!chk()){
//    cout<<"nowsum "<<sum<<"\n";
    ++cnt;
    if(cnt>V) {
    //  puts("fail");
      return;
    }
  //  if(cnt%1000==0)cerr<<"cnt "<<cnt<<" "<<sum<<"\n";
    int u=q[rnd()%m+1];
//      u=rnd()%n+1;
    double xx=x[u],yy=y[u],zz=z[u],ss=sum;
    
    
    int op=rnd()%3;
    if(op==0)x[u]=R(x[u]-t,x[u]+t);
    else if(op==1)y[u]=R(y[u]-t,y[u]+t);
    else z[u]=R(z[u]-t,z[u]+t);
    
    calc();
    if(ss<sum){
      x[u]=xx,y[u]=yy,z[u]=zz;
      calc();
    }
//    else cout<<"ss,sum "<<ss<<" "<<sum<<"\n";
//    cout<<"SSss,sum "<<min(ss,sum)<<" "<<sum<<"\n";
    t*=0.995;
    
  }
  For(i,1,n)printf("%.13lf %.13lf %.13lf\n",x[i],y[i],z[i]);
  exit(0);
}

signed main()
{
//  freopen("data.in","r",stdin);
  n=read();
  For(i,1,n)For(j,1,n)cin>>d[i][j];
  For(i,1,n)x[i]=R(),y[i]=R(),z[i]=R();
  while(1){
    work();
  }
  return 0;
}
/*

*/