#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;

#include "bits/stdc++.h"
#include<unordered_map>
#pragma warning(disable:4996)
using namespace std;

struct Point3 {
	long double x;
	long double y;
	long double z;
	Point3() :x(0), y(0), z(0) {}
	Point3(const long double _x, const long double _y, const long double _z) :x(_x), y(_y), z(_z) {}
};

Point3 operator+(const Point3&l, const Point3& r) {
	return Point3(l.x + r.x, l.y + r.y, l.z + r.z);
}
Point3 operator+=(Point3&l, const Point3& r) {
	return l = Point3(l.x + r.x, l.y + r.y, l.z + r.z);
}
Point3 operator-(const Point3&l, const Point3& r) {
	return Point3(l.x - r.x, l.y - r.y, l.z - r.z);
}
Point3 operator-=(Point3&l, const Point3& r) {
	return l = Point3(l.x - r.x, l.y - r.y, l.z - r.z);
}
Point3 operator*(const Point3&l, const long double r) {
	return Point3(l.x * r, l.y * r, l.z * r);
}
Point3 operator*(const long double r, const Point3&l) {
	return l*r;
}
Point3 operator*=(Point3&l, const long double r) {
	return l = Point3(l.x * r, l.y * r, l.z * r);
}
Point3 operator/(const Point3&l, const long double r) {
	return Point3(l.x / r, l.y / r, l.z / r);
}
Point3 operator/=(Point3&l, const long double r) {
	return l = Point3(l.x / r, l.y / r, l.z / r);
}
const long double eps = 1e-9, pi = acos(-1.0);
const long double dtop = pi / 180.;
const long double ptod = 1. / dtop;

namespace std {
	bool operator<(const Point3 &lhs, const Point3 &rhs) {
		if (lhs.x< rhs.x - eps) return true;
		if (lhs.x > rhs.x + eps) return false;
		if (lhs.y< rhs.y - eps) return true;
		if (lhs.y > rhs.y + eps) return false;
		return lhs.z < rhs.z;
	}
}

// ????????\???
Point3 input_point() {
	long double x, y, z;
	cin >> x >> y >> z;
	return Point3(x, y, z);
}

// ????????????????????????
bool eq(const long double a, const long double b) {
	return (abs(a - b) < eps);
}

// ??????
long double dot(const Point3& a, const Point3& b) {
	return a.x*b.x + a.y*b.y + a.z*b.z;
}

// ??????
Point3 cross(const Point3& a, const Point3& b) {
	return Point3(a.y*b.z - a.z*b.y, a.z*b.x - a.x*b.z, a.x*b.y - a.y*b.x);
}



//?????????
long double norm(const Point3&p) {
	return (p.x*p.x + p.y*p.y + p.z*p.z);
}

long double abs(const Point3&p) {

	return sqrt(p.x*p.x + p.y*p.y + p.z*p.z);
}
//?????????????????????
Point3 unit(const Point3& a) {
	return a / (abs(a));
}




//???
struct Sphere {
	Point3 p;
	long double r;
	Sphere() :p(), r(0) {}
	Sphere(const Point3 _point, const long double _radius) :p(_point), r(_radius) {}
};

// ??´????????????
class Line3 {
public:
	Point3 a, b;
	Line3() : a(Point3(0, 0, 0)), b(Point3(0, 0, 0)) {}
	Line3(Point3 a, Point3 b) : a(a), b(b) {}
	Point3 operator[](const int _num)const {
		if (_num == 0)return a;
		else if (_num == 1)return b;
		else assert(false);
	}
};

// ?????????????????????
bool isis_sp(const Line3& s, const Point3& p) {
	return (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);
}

// ??????????¶?
Point3 proj(const Line3 &l, const Point3& p) {
	long double t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);
	return l.a + t * (l.a - l.b);
}
// ??´?????¨???????????¢
long double dist_lp3(const Line3& l, const Point3& p) {
	return abs(p - proj(l, p));
}
// ?????¨??´????????????
vector<Point3> is_lsp(const Sphere& c, const Line3& l) {
	vector<Point3> res;
	long double d = dist_lp3(l, c.p);
	if (d < c.r + eps) {
		long double len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;
		Point3 nor = (l.a - l.b) / abs(l.a - l.b);
		res.push_back(proj(l, c.p) + len * nor);
		res.push_back(proj(l, c.p) - len * nor);
	}
	return res;
}
// ?????¨???????????????
vector<Point3> is_ssp(const Sphere& c, const Line3& l) {
	vector<Point3> res(is_lsp(c, l));
	vector<Point3> nres;
	for (auto p : res) {
		if (isis_sp(l, p))nres.emplace_back(p);
	}
	return nres;
}
// ????????????????????¢(??????)??§???????°?
Point3 reflect(const Point3& vec, const Point3& no) {
	return vec- 2 * dot(vec, no)/abs(no)*unit(no);

}
int main() {
	while (1) {
		int N;
		cin >> N;
		if (!N)break;
		int u, v, w; cin >> u >> v >> w;
		vector<Sphere>sps;
		for (int i = 0; i < N; ++i) {
			int x, y, z, r; cin >> x >> y >> z >> r;
			sps.push_back(Sphere(Point3(x, y, z), r));
		}
		Line3 l(Point3(), 1e3*Point3(u, v, w));
		int pre = -1;
		while (1) {
			int spid=-1;
			Point3 refp;
			ld mindis = 1e18;
			for (int s = 0; s < sps.size();++s) {
				if (s == pre)continue;
				Sphere sp= sps[s];
				const vector<Point3>nrefps(is_ssp(sp, l));
				for (const auto p : nrefps) {
					const ld dis = abs(p - l[0]);
					if (dis < mindis) {
						spid = s;
						refp = p;
						mindis = dis;
					}
				}
			}
			if (spid==-1) {
				cout << setprecision(5) << fixed << l[0].x << " " << l[0].y << " " << l[0].z << endl;
				break;
			}
			else {
				Point3 newvec = reflect(l[1] - l[0], refp - sps[spid].p);
				Line3 newl(refp, refp+newvec);
				l = newl;
				pre = spid;
			}
		}
	}
	
	return 0;
}

Measured memory_bytes: 3232