#include<iostream>
#include<algorithm>
#include<sstream>
#include<vector>
#include<map>
#include<queue>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cassert>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fr(i,c) for(__typeof(c.begin()) i=c.begin();i!=c.end();i++)
#define pb push_back
#define mp make_pair
#define all(c) c.begin(),c.end()

typedef vector<int> vi;
typedef pair<int,int> pi;
typedef long long ll;
const int inf=(int)1e9;
const double EPS=1e-9, INF=1e12,PI=acos(-1);

typedef complex<double> P;
namespace std {
  bool operator < (const P& a, const P& b) {
    return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
  }
}
double cross(const P& a, const P& b) {
  return imag(conj(a)*b);
}
double dot(const P& a, const P& b) {
  return real(conj(a)*b);
}
struct L : public vector<P> {
  L(const P &a, const P &b) {
    push_back(a); push_back(b);
  }
};
typedef vector<P> G;
struct C {
  P p; double r;
  C(const P &p, double r) : p(p), r(r) { }
};
int ccw(P a, P b, P c) {
  b -= a; c -= a;
  if (cross(b, c) > 0)   return +1;       // counter clockwise
  if (cross(b, c) < 0)   return -1;       // clockwise
  if (dot(b, c) < 0)     return +2;       // c--a--b on line
  if (norm(b) < norm(c)) return -2;       // a--b--c on line
  return 0;
}
bool intersectLS(const L &l, const L &s) {
  return cross(l[1]-l[0], s[0]-l[0])*       // s[0] is left of l
         cross(l[1]-l[0], s[1]-l[0]) < EPS; // s[1] is right of l
}
P crosspoint(const L &l, const L &m) {
  double A = cross(l[1] - l[0], m[1] - m[0]);
  double B = cross(l[1] - l[0], l[1] - m[0]);
  if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line
  if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!
  return m[0] + B / A * (m[1] - m[0]);
}
G convex_hull(G ps) {
  int n = ps.size(), k = 0;
  sort(ps.begin(), ps.end());
  G ch(2*n);
  for (int i = 0; i < n; ch[k++] = ps[i++]) // lower-hull
    while (k >= 2 && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;
  for (int i = n-2, t = k+1; i >= 0; ch[k++] = ps[i--]) // upper-hull
    while (k >= t && ccw(ch[k-2], ch[k-1], ps[i]) <= 0) --k;
  ch.resize(k-1);
  return ch;
}
#define curr(P, i) P[i]
#define next(P, i) P[(i+1)%P.size()]
double area2(const G& p) {
  double A = 0;
  for (int i = 0; i < p.size(); ++i) 
    A += cross(curr(p, i), next(p, i));
  return A;
}
int n;
double calc(double mid,const G &g){
	const P p(cos(mid),sin(mid));
	G ps, g1, g2;
	rep(k,n)if(intersectLS(L(P(0,0),p),L(g[k],g[(k+1)%n])))
		ps.pb(crosspoint(L(P(0,0),p),L(g[k],g[(k+1)%n])));
	rep(i,ps.size()){
		g1.pb(ps[(int)ps.size()-i-1]); g2.pb(ps[i]);
	}
	int a=-1,b=-1;
	rep(k,n)if(ccw(P(0,0),p,g[k])>0){
		g1.pb(g[k]);
		if(a<0)a=k;
		b=k;
	}
	for(int i=b+1;i<a+n;i++)g2.pb(g[i%n]);
	
	return area2(g1)-area2(g2);
}
int main(){
	while(cin>>n,n){
		G g;
		vector<double> as;
		rep(i,n){
			int x,y; cin>>x>>y;
			g.pb(P(x,y));
			as.pb(arg(g[i]));
			if(as.back()<0)as.back()+=2*PI;
		}
		bool ok=0;
		as.pb(0); as.pb(2*PI);
		sort(all(as));
		rep(i,as.size()-1){
			double lo=as[i], hi=as[i+1],mid,err;
			if(abs(calc(lo,g))>1e-6&&abs(calc(hi,g))>1e-6)continue;
			rep(j,100){
				mid=(lo+hi)/2;
				err=calc(mid,g);
				if(err>0)hi=mid;
				else lo=mid;
			}
			//cerr<<as[i]<<" "<<as[i+1]<<" "<<lo<<" "<<err<<endl;
			if(abs(err)<1e-6){
				printf("%.20f %.20f\n", 2*cos(lo), 2*sin(lo));
				ok=1; break;
			}
		}
	}
	return 0;
}

Measured memory_bytes: 0