//By SiriusRen

#include <cmath>

#include <cstdio>

#include <algorithm>

using namespace std;

int cases,n;

typedef double db;

struct P{db x,y;P(){}P(db X,db Y){x=X,y=Y;}}p[][];

bool operator<(P a,P b){return a.x<b.x;}

P operator-(P a,P b){return P(a.x-b.x,a.y-b.y);}

P operator+(P a,P b){return P(a.x+b.x,a.y+b.y);}

db dis(P a){return sqrt(a.x*a.x+a.y*a.y);}

P get(P a,P b){

    P c=b-a;db d=dis(c),p=d/+,S=sqrt(p*(p-)*(p-)*(p-d)),h=S/d*;

    c.x/=d,c.y/=d;c=P(-c.y*h,c.x*h);

    return P((a.x+b.x)/+c.x,(a.y+b.y)/+c.y);

}

int main(){

    while(scanf("%d",&n)&&n){

        for(int i=;i<=n;i++)scanf("%lf",&p[n][i].x),p[n][i].y=;

        sort(p[n]+,p[n]++n);

        for(int i=n-;i;i--)

            for(int j=;j<=i;j++)

                p[i][j]=get(p[i+][j],p[i+][j+]);

        printf("%.4lf %.4lf\n",p[][].x,p[][].y);

    }

}