Problem: A rich man has a square room with mirrors for security or just for fun. Each side of the room is eight meters wide. The floor, the ceiling and the walls are not special; however, the room can be equipped with a lot of mirrors on the walls or as vertical partitions.

Every mirror is one meter wide, as tall as the wall, double-side, perfectly reflective, and ultimately thin.

Poles to fix mirrors are located at the corners of the room, on the walls and inside the room. Their locations are the 81 lattice points at intervals of one meter. A mirror can be fixed between two poles which are one meter distant from each other. If we use the sign "+" to represent a pole, the overview of the room can be illustrated as follows.

<image>

Let us denote a location on the floor by (x,y) in a rectangular coordinate system. For example, the rectangular coordinates of the four corners of the room are (0,0), (8,0), (0,8) and (8,8), respectively. The location (x,y) is in the room if and only if the conditions 0 ≤ x ≤ 8 and 0 ≤ y ≤ 8 are satisfied. If i and j are integers satisfying the conditions 0 ≤ i ≤ 8 and 0 ≤ j ≤ 8, we can denote by (i,j) the locations of poles.

One day a thief intruded into this room possibly by breaking the ceiling. He stood at (0.75,0.25) and looked almost toward the center of the room. Precisely speaking, he looked toward the point (1, 0.5) of the same height as his eyes. So what did he see in the center of his sight? He would have seen one of the walls or himself as follows.

* If there existed no mirror, he saw the wall at (8, 7.5)
* If there existed one mirror between two poles at (8, 7) and (8, 8), he saw the wall at (7.5, 8). (Let us denote the line between these two poles by (8, 7)-(8, 8).)
* If there were four mirrors on (8, 7)-(8, 8), (7, 8)-(8, 8), (0, 0)-(0, 1) and (0, 0)-(1, 0), he saw himself at (0.75, 0.25).
* If there were four mirrors on (2, 1)-(2, 2), (1, 2)-(2, 2), (0, 0)-(0, 1) and (0, 0)-(1, 0), he saw himself at (0.75, 0.25)



Your job is to write a program that reports the location at which the thief saw one of the walls or himself with the given mirror arrangements.



Input

The input contains multiple data sets, each representing how to equip the room with mirrors. A data set is given in the following format.


n
d1 i1 j1
d2 i2 j2
. . .
dn in jn


The first integer n is the number of mirrors, such that 0 ≤ n ≤ 144. The way the k-th (1 ≤ k ≤ n) mirror is fixed is given by dk and (ik,jk). dk is either 'x' or 'y', which gives the direction of the mirror. If dk is 'x', the mirror is fixed on (ik, jk)-(ik + 1, jk). If dk is 'y', the mirror is fixed on (ik,jk) (ik,jk + 1). The end of the input is indicated by a negative integer.

Output

For each data set, your program should output the location (x,y) at which the thief saw one of the walls or himself. The location should be reported in a line containing two integers which are separated by a single space and respectively represent x and y in centimeter as the unit of length. No extra lines nor spaces are allowed.

Example

Input

0
1
y 8 7
4
y 8 7
x 7 8
y 0 0
x 0 0
4
y 2 1
x 1 2
y 0 0
x 0 0
-1


Output

800 750
750 800
75 25
75 25

Solution (in CPP):

Solution:
#include <climits>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;

#define REP(i, a, b) for(int i = (a); i < int(b); ++i)
#define rep(i, n) REP(i, 0, n)

struct point {
	long long x, y;
	explicit point(long long x_ = 0, long long y_ = 0):x(x_), y(y_) {}

	inline point operator+(const point &p) const {
		return point(x + p.x, y + p.y);
	}

	inline point operator-(const point &p) const {
		return point(x - p.x, y - p.y);
	}

	inline point operator*(long long s) const {
		return point(x * s, y * s);
	}

	inline point operator/(long long s) const {
		return point(x / s, y / s);
	}

	inline bool operator==(const point &p) const {
		return x == p.x && y == p.y;
	}
};

struct segment {
	point a, b;
	segment(const point &a_, const point &b_):a(a_), b(b_) {}
};

struct line {
	point a, b;
	line(const point &a_, const point &b_):a(a_), b(b_) {}
};

typedef vector<point> polygon;

inline point rotate90(const point &p) {
	return point(-p.y, p.x);
}

inline long long norm(const point &p) {
	return p.x * p.x + p.y * p.y;
}

inline long long dot(const point &a, const point &b) {
	return a.x * b.x + a.y * b.y;
}

inline long long cross(const point &a, const point &b) {
	return a.x * b.y - a.y * b.x;
}

inline long long ccw(const point &a, point b, point c) {
	b = b - a;
	c = c - a;
	const long long t = cross(b, c);
	if(t > 0) return 1;
	if(t < 0) return -1;
	if(dot(b, c) < 0) return 2;
	if(norm(b) < norm(c)) return -2;
	return 0;
}

inline bool intersect(const segment &s, const point &p) {
	return !(s.a == p) && !(s.b == p) && ccw(s.a, s.b, p) == 0;
}

inline bool intersect(const segment &s, const segment &t) {
	return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) < 0
		&& ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) < 0;
}

inline bool intersect(const line &l, const segment &s) {
	return cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) <= 0;
}

inline bool orthogonal(const line &l, const line &m) {
	if(l.a == l.b || m.a == m.b) return false;
	return dot(l.a - l.b, m.a - m.b) == 0;
}

inline point crosspoint(const segment &s, const segment &t) {
	const long long tmp = cross(s.b - s.a, t.b - t.a);
	if(tmp == 0) {
		if(intersect(s, t.a)) return t.a;
		if(intersect(s, t.b)) return t.b;
		if(intersect(t, s.a)) return s.a;
		return s.b;
	}
	return t.a + (t.b - t.a) * cross(s.b - s.a, s.b - t.a) / tmp;
}

point solve(vector<segment> &mirrors) {
	const point thief(75, 25);
	const point direction(1, 1);
	const polygon wall{point(0, 0), point(800, 0), point(800, 800), point(0, 800)};

	const int n = mirrors.size();
	segment sight_line(thief, thief + direction * 5000);

	while(true) {
		int idx = -1;
		point next;
		long long min_dist = LLONG_MAX;

		if(intersect(sight_line, thief)) {
			next = thief;
			min_dist = norm(thief - sight_line.a);
		}

		rep(i, n) {
			if(intersect(sight_line, mirrors[i])) {
				const point cp = crosspoint(sight_line, mirrors[i]);
				const long long d = norm(cp - sight_line.a);

				if(d < min_dist) {
					next = cp;
					min_dist = d;
					idx = i;
				}
			}
		}

		rep(i, 4) {
			const segment s(wall[i], wall[(i + 1) % 4]);
			if(intersect(sight_line, s)) {
				const point cp = crosspoint(sight_line, s);
				const long long d = norm(cp - sight_line.a);

				if(d < min_dist) {
					next = cp;
					min_dist = d;
				}
			}
		}

		if(idx == -1) return next;

		point next_toward = sight_line.b;
		do {
			next_toward = rotate90(next_toward - next) + next;
		} while(!orthogonal(line(mirrors[idx].a, mirrors[idx].b), line(sight_line.b, next_toward)));

		sight_line.a = next;
		sight_line.b = next_toward;
	}
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	for(int n; cin >> n && n >= 0;) {
		vector<segment> mirrors;
		mirrors.reserve(n);

		rep(i, n) {
			char d;
			int x, y;
			cin >> d >> x >> y;

			if(d == 'x') {
				mirrors.emplace_back(point(x * 100, y * 100), point((x + 1) * 100, y * 100));
			}
			else {
				mirrors.emplace_back(point(x * 100, y * 100), point(x * 100, (y + 1) * 100));
			}
		}

		const point ans = solve(mirrors);
		cout << ans.x << " " << ans.y << endl;
	}

	return EXIT_SUCCESS;
}