#include <stdio.h>
#include <algorithm>
#include <math.h>

using namespace std;

const double eps = 1e-7;
struct node {
	double x , y , r , s;
	int del;
} a[120] , b[120];
int n;
double dis ( double x1 , double y1 , double x2 , double y2 ) {
	return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
double gettime () {
	int i , j;
	double ret = 1e15;
	for ( i = 1 ; i <= n ; i++ ) {
		for ( j = i + 1 ; j <= n ; j++ ) {
			//printf ( "%lf %lf\n" , dis (a[i].x,a[i].y,a[j].x,a[j].y)-a[i].r-a[j].r , a[i].s+a[j].s );
			ret = min ( ret , (dis (a[i].x,a[i].y,a[j].x,a[j].y)-a[i].r-a[j].r) / (a[i].s+a[j].s) );
		}
	}
	return ret;
}
void expand ( double t ) {
	int i;
	for ( i = 1 ; i <= n ; i++ ) {
		a[i].r += t * a[i].s;
	}
}
int touch ( node x1 , node x2 ) {
	//printf ( "%.10lf\n" , dis(x1.x,x1.y,x2.x,x2.y) - x1.r - x2.r );
	if ( dis(x1.x,x1.y,x2.x,x2.y) - x1.r - x2.r < eps ) return 1;
	return 0;
}
void merge () {
	int i , j , cnt , m;
	int fi = -1 , fj;
	node now , nnow;
	for ( i = 1 ; i <= n ; i++ ) {
		for ( j = i + 1 ; j <= n ; j++ ) {
			if ( touch ( a[i] , a[j] ) == 1 ) {
				fi = i;
				fj = j;
				break;
			}
		}
		if ( fi != -1 ) break;
	}
	//printf ( "%d\n" , fi );
	now.x = (a[fi].x + a[fj].x) / 2;
	now.y = (a[fi].y + a[fj].y) / 2;
	//printf ( "@@%lf %lf\n" , a[fi].r , a[fj].r );
	now.r = sqrt ( a[fi].r*a[fi].r + a[fj].r * a[fj].r );
	now.s = max ( a[fi].s , a[fj].s );
	now.del = 0;
	a[i].del = 1;
	a[j].del = 1;
	for ( i = 2 ; i <= n ; i++ ) {
		nnow = now;
		nnow.r = nnow.r * nnow.r;
		cnt = 1;
		for ( j = 1 ; j <= n ; j++ ) {
			if ( a[j].del == 0 ) {
				if ( touch ( now , a[j] ) == 1 ) {
					nnow.x += a[j].x;
					nnow.y += a[j].y;
					nnow.r += a[j].r * a[j].r;
					nnow.s = max ( nnow.s , a[j].s );
					cnt++;
					a[j].del = 1;
				}
			}
		}
		if ( cnt == 1 ) break;
		nnow.r = sqrt ( nnow.r );
		nnow.x /= cnt;
		nnow.y /= cnt;
		now = nnow;
	}
	m = 1;
	b[1] = now;
	for ( i = 1 ; i <= n ; i++ ) {
		if ( a[i].del == 0 ) b[++m] = a[i];
	}
	for ( i = 1 ; i <= m ; i++ ) {
		a[i] = b[i];
	}
	n = m;
}
void work () {
	int i;
	double t;
	scanf ( "%d" , &n );
	for ( i = 1 ; i <= n ; i++ ) {
		//a[i].x = i*i; a[i].y = 0; a[i].r = 0.1; a[i].s = 0;
		scanf ( "%lf%lf%lf%lf" , &a[i].x , &a[i].y , &a[i].r , &a[i].s );
	}
	while ( n > 1 ) {
		t = gettime ();
		expand ( t );
		merge ();
		//printf ( "%lf\n" , t );
	}
	printf ( "%.10lf %.10lf\n" , a[1].x , a[1].y );
	printf ( "%.10lf\n" , a[1].r );
}
int main () {
	work ();
	return 0;
}