#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<cassert>
#include<vector>
#include<map>
#include<complex>
using namespace std;
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n)   REP(i,0,n)
template<class T> void vp(T &a,int size){rep(i,size)cout << a[i]<<" ";cout << endl;}

typedef complex<double> P;


const double eps = 1e-10;
double cross(P a,P b){
  return a.real()*b.imag() - a.imag()*b.real();
}

bool is_intersect_ll(P a1,P a2,P b1,P b2){
  return !(abs(cross(a1-a2,b1-b2)) <  eps);
}

P intersection_ll(P a1,P a2,P b1,P b2){
  P a = a2-a1,b = b2-b1;
  return a1 + a*cross(b,b1-a1)/cross(b,a);
}

namespace std{
  bool operator<(const P &a,const P &b){
    double ta = arg(a),tb=arg(b);
    return ta < tb;
  }
}

double Polygon_Area(vector<P> &a,int n){
  double sum = 0;
  rep(i,n){
    sum += (a[i].real()-a[(i+1)%n].real())*(a[i].imag()+a[(i+1)%n].imag());
  }
  if (sum < 0)sum *= -1;
  return (double)(sum/2.0);
}

enum{RIGHT=1,LEFT=-1,ELSE=0};
int ccw(P a,P b){
  if (cross(a,b) < 0)return RIGHT;
  else if (cross(a,b)>0)return LEFT;
  return ELSE;
}

vector<P> Convex_Cut(vector<P> &in,P a1,P a2){
  vector<P> ret;
  rep(i,in.size()){
    P now = in[i],next = in[(i+1)%in.size()];
    if (ccw(a1-a2,now-a2) == LEFT)ret.push_back(now);
    if (ccw(a1-a2,now-a2)*ccw(a1-a2,next-a2) < 0){
      ret.push_back(intersection_ll(a1,a2,now,next));
    }
  }
  return ret;
}

double getArea(vector<P> &in,P cp2){
  static P cp1(0,0);
  vector<P> a = Convex_Cut(in,cp1,cp2);
  return Polygon_Area(a,a.size());
}

P solve(bool &fg,vector<P> &in,P l,P r,double area){
  P ret;
  /*p1ÌÙ¤ªå«©Á½çp1,r
    p2ÌÙ¤ªå«©Á½çl,p1
    ÆÈéB
    ±ÌêÍxNg(l-r)*1/3Æ©·êÎ¨
   */
  /*
  rep(i,100){
    P a = l+(r-l)/abs(r-l) * (abs(r-l)*(double)(i+1)/100.0);
    double ar = getArea(in,a);
    cout <<"gue " <<  a <<" " << ar << " " << " " << abs(ar*2 - area) << " " << area << endl;
  }
  cout <<"---------------------"<<endl;
  */

  rep(i,100){
    P p1=l+(r-l)/3., p2=l+(r-l)*(2.0)/(3.0);//p1 = l+(l-r)*(1/3), p2 = l + (l-r)*(2/3)    
    ret = p2;
    double a1 = getArea(in,p1),a2= getArea(in,p2);
    a1 = max(a1,area-a1);
    a2 = max(a2,area-a2);

    //cout << l<<" "<< p1 <<" " << p2 <<" " << r << " " <<a1 <<" " << a2 << endl;
    if (a1 > a2){
      l = p1;
    }else {
      r = p2;
    }
  }

  double ar=getArea(in,ret);
  if (abs(ar*2-area) < 1e-5)fg = true;
  //cout << ar <<" " << area << " " << abs(ar*2-area) << " " << fg << endl;
  return ret;
}

main(){
  int n;
  P ori(0,0);
  while(cin>>n && n){
    vector<P> in(n),all,tmp;
    rep(i,in.size()){
      cin>>in[i].real()>>in[i].imag();
    }
    /*´_Æ éÓÌ_Æð··é_ð­©µÄSÛ¶µÄ¨­*/
    rep(i,n){
      all.push_back(in[i]);
      rep(j,n){
	P &a1=  in[i], &a2 = in[(i+1)%in.size()];
	if (!is_intersect_ll(a1,a2,ori,in[i]))continue;
	all.push_back(intersection_ll(a1,a2,ori,in[i]));
      }
    }
    /*unique*/
    tmp = all;
    all.clear();
    rep(i,tmp.size()){
      bool fg = true;
      rep(j,all.size()){
	if (abs(all[j] - tmp[i]) < eps)fg = false;
      }
      if (fg)all.push_back(tmp[i]);
    }

    /*sort by angle*/
    sort(all.begin(),all.end());

    double area = Polygon_Area(in,n);

    /*ãÅ©Â¯½_iÆ»Ì×Ú·é_i+1ÌÔÅAOªTõð·éB*/
    rep(i,all.size()){
      P &a = all[i], &b = all[(i+1)%all.size()];
      bool fg = false;
      P ans = solve(fg,in,a,b,area);
      if (fg){
	ans -= P(0,0);
	ans /= abs(ans);
	printf("%.15lf %.15lf\n",ans.real(),ans.imag());
	goto end;
      }
    }
    cout <<"noanswer " << endl;
    assert(false);
end:;

  }
  return false;
}

Measured memory_bytes: 1028