#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;
}
### Prompt

Your challenge is to write a cpp solution to the following problem:

Sha, Nero, Eri, and Ko, who entered the University of Aizu Elementary School (Aizu University and Small), decided to participate in a programming contest called IPPC in order to play an active role as a competition programmer. However, IPPCs are required to participate in the contest as a team of three people, and it is not possible to form a team of four people. Therefore, they decided to form a team of two people and participate in a programming contest called IPOCH where two people can participate in one group.

Although the teams have been separated, their abilities are competing and they are good practice partners for each other.

One day their coach bought a whole cake to put in. They decided to eat it at Sha's house. However, when I got home and opened the box, the cake was deformed, and when viewed from above, it looked like a convex polygon instead of a circle. It seems that it was bad to have Nero carry it. There is a strawberry on top of the cake. For the time being, it was decided to cut this cake with a knife in half along a straight line through the strawberries in order to divide it into two teams. It is against their aesthetic sense to take the strawberries first before cutting the cake.

Your job is to divide a convex polygon K given on a two-dimensional plane by a straight line L passing through the origin (0, 0), and then divide the straight line L so that the areas of the two convex polygons created by the division are equal. To determine. If there are more than one, one of them will do.
<image>

Constraints

* All inputs are integers
* 3 ≤ N ≤ 20
* -100 ≤ xi ≤ 100 (1 ≤ i ≤ N)
* -100 ≤ yi ≤ 100 (1 ≤ i ≤ N)
* The number of test cases does not exceed 1,000.

Input

The input consists of multiple test cases. Each test case follows the format below.


N
x1 y1
x2 y2
...
xN yN


N is the number of vertices of the given convex polygon K. The points (xi, yi) (1 ≤ i ≤ N) are all the coordinates of the vertices that make up the convex polygon K and are different from each other. These are given in counterclockwise order. Also, a point on any side of the convex polygon K has a distance of 1 or more from the origin, and the convex polygon K always contains the origin. The end of input is indicated by one line containing one 0. Note that the three different points given by the input, including the origin, can be collinear.

Output

Output the point A (Ax, Ay) on the straight line L in the following format. However, the distance between point A and the origin must be 1 or more.


Ax Ay


When the convex polygon K is divided by the origin and a straight line passing through this point A, the difference in area between the two convex polygons must be less than 10-5. I want the coordinates of point A to be output 15 digits after the decimal point.

Example

Input

4
-100 -100
100 -100
100 100
-100 100
4
-99 -100
100 -100
100 100
-99 100
4
-100 -99
100 -99
100 100
-100 100
14
-99 -70
-92 -79
10 -98
37 -100
62 -95
77 -69
88 -47
92 -10
96 28
100 91
42 92
-62 92
-88 91
-98 64
0


Output

100.000000000000000 0.000000000000000
100.000000000000000 0.000000000000000
0.000000000000000 100.000000000000000
-96.983291994836122 66.745111613942484

### Response

```cpp
#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;
}
```