// 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

typedef double DB;
#define double long double

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 200005
#define inf 0x3f3f3f3f

typedef double db;
const db eps=1e-10,pi=3.14159265358979323846;
int sgn(db x){return x<-eps?-1:x>eps;}

struct P{
  db x,y;
  P(db x=0,db y=0):x(x),y(y){}
  P&operator +=(P o){return x+=o.x,y+=o.y,*this;}
  P&operator -=(P o){return x-=o.x,y-=o.y,*this;}
  P&operator *=(db o){return x*=o,y*=o,*this;}
  P&operator /=(db o){return x/=o,y/=o,*this;}
  friend P operator +(P a,P b){return a+=b;}
  friend P operator -(P a,P b){return a-=b;}
  friend P operator *(P a,db b){return a*=b;}
  friend P operator /(P a,db b){return a/=b;}
  friend bool operator <(P a,P b){return fabs(a.x-b.x)<eps?a.y<b.y:a.x<b.x;}
  friend db operator %(P a,P b){return a.x*b.x+a.y*b.y;} // dot
  friend db operator *(P a,P b){return a.x*b.y-a.y*b.x;} // cross
  
  P rot(db o){
    db s=sin(o),c=cos(o);
    return P(x*c-y*s,x*s+y*c);
  }
  P rot90(){return P(-y,x);}
  db ang(){return atan2(y,x);}
  db l(){return sqrt(x*x+y*y);}
  
  int half(){
    return sgn(y)==1||(sgn(y)==0&&sgn(x)>=0);
  }
  P unit(){return ((*this))/l();}
  P inv(){
    db d=l();
    return P(x/d,-y/d);
  }
  
  void read(){cin>>x>>y;}
  void out(){cout<<"("<<x<<","<<y<<")"<<endl;}
};

int n;
int sz[maxn];
P a[405][405],b[405][405];
pii to[405][405];
double ang[405][405];

struct L{
  P a,b;
  double d;
  int u,v;
};
L l[405][405];
L st[maxn];
int len;

void cb(db &x){
  while(x<-pi)x+=pi*2;
  while(x>pi)x-=pi*2;
}

queue<int>q;
bool vis[maxn];

void find(){
  For(i,1,n)
    For(j,0,sz[i]-1) ang[i][j]=(l[i][j].b-l[i][j].a).ang();
  For(i,1,n){
    For(j,0,sz[i]-1){
      db t=ang[i][j]-ang[i][(j-1+sz[i])%sz[i]];
      cb(t);
      if(sgn(t-0.5*pi)==0){
        q.push(i);
        vis[i]=1;
        b[i][j]=P(0,0);
        db o=-ang[i][j];
        For(k,1,sz[i]-1){
          int x=(k+j)%sz[i];
          b[i][x]=a[i][x]-a[i][j];
      //    cout<<"x: "<<x<<"\n";
          b[i][x]=b[i][x].rot(o);
        }
      //  cout<<"i; "<<i<<"\n";
      //  For(k,0,sz[i]-1) b[i][k].out();
        return;
      }
    }
  }
  assert(0);
}

double get(double x){
  x=max(x,0.0l);
  x=min(x,1.0l);
  return x;
}

signed main()
{
  n=read();
  For(i,1,n){
    sz[i]=read();
    For(j,0,sz[i]-1)a[i][j].read();
    
    For(j,0,sz[i]-1){
      int k=(j+1)%sz[i];
      l[i][j].a=a[i][j];
      l[i][j].b=a[i][k];
      l[i][j].d=(a[i][j]-a[i][k])%(a[i][j]-a[i][k]);
      st[++len]=l[i][j];
      st[len].u=i;
      st[len].v=j;
    }
  }
  sort(st+1,st+len+1,[&](L a,L b){
    return a.d<b.d;
  });
  for(int i=1;i<=len; ){
    if(i==len || sgn(st[i].d-1.0)==0 || sgn(st[i].d-st[i+1].d)!=0){
      ++i;
      continue;
    }
    to[st[i].u][st[i].v]=mkp(st[i+1].u,st[i+1].v);
    to[st[i+1].u][st[i+1].v]=mkp(st[i].u,st[i].v);
    i+=2;
  }
  find();
  while(q.size()){
    int i=q.front();q.pop();
    For(j,0,sz[i]-1){
      if(!to[i][j].fi)continue;
      if(vis[to[i][j].fi])continue;
      
      int v=to[i][j].fi,j2=to[i][j].se;
      vis[v]=1,q.push(v);
    //  cout<<"i,j,v,j2 "<<i<<" "<<j<<" "<<v<<" "<<j2<<"\n";
      
      db o=(b[i][(j+1)%sz[i]]-b[i][j]).ang()+pi-ang[v][j2];
      
      b[v][j2]=b[i][(j+1)%sz[i]];
      For(k,1,sz[v]-1){
        int x=(k+j2)%sz[v];
        b[v][x]=a[v][x]-a[v][j2];
        b[v][x]=b[v][x].rot(o);
        b[v][x]+=b[v][j2];
      }
    //  cout<<"v: "<<v<<"\n";
    //  For(k,0,sz[v]-1)b[v][k].out();
    }
  }
  
  For(i,1,n){
    For(j,0,sz[i]-1) printf("%.11lf %.11lf\n",(DB)get(b[i][j].x),(DB)get(b[i][j].y));
    puts("");
  }
  return 0;
}
/*

*/