We understand that reading English is a great pain to many of you. So we’ll keep this problem statememt simple. Write a program that reports the point equally distant from a set of lines given as the input. In case of no solutions or multiple solutions, your program should report as such.



Input

The input consists of multiple datasets. Each dataset is given in the following format:

n
x1,1 y1,1 x1,2 y1,2
x2,1 y2,1 x2,2 y2,2
...
xn,1 yn,1 xn,2 yn,2


n is the number of lines (1 ≤ n ≤ 100); (xi,1, yi,1) and (xi,2, yi,2) denote the different points the i-th line passes through. The lines do not coincide each other. The coordinates are all integers between -10000 and 10000.

The last dataset is followed by a line containing one zero. This line is not a part of any dataset and should not be processed.

Output

For each dataset, print a line as follows. If there is exactly one point equally distant from all the given lines, print the x- and y-coordinates in this order with a single space between them. If there is more than one such point, just print "Many" (without quotes). If there is none, just print "None" (without quotes).

The coordinates may be printed with any number of digits after the decimal point, but should be accurate to 10-4.

Example

Input

2
-35 -35 100 100
-49 49 2000 -2000
4
0 0 0 3
0 0 3 0
0 3 3 3
3 0 3 3
4
0 3 -4 6
3 0 6 -4
2 3 6 6
-1 2 -4 6
0


Output

Many
1.5000 1.5000
1.000 1.000
#include<cstring>
#include<cstdio>
#include<cmath>
#include<set>
using namespace std;
const int N(111);
struct Point {
	double x, y;
	void scan() {
		scanf("%lf%lf", &x, &y);
	}
	Point() {
	}
	Point(const double & a, const double & b) : x(a), y(b) {
	}
	double sqrlen() const {
		return x * x + y * y;
	}
	double len() const {
		return sqrt(max(0., sqrlen()));
	}
	Point zoom(const double & l) const {
		double lambda(l / len());
		return Point(lambda * x, lambda * y);
	}
	Point rev() const {
		return Point(-y, x);
	}
	void print() const {
		printf("%.10f %.10f\n", x, y);
	}
} s[N], t[N];
struct Line {
	Point s, d;
	Line(const Point & a, const Point & b) : s(a), d(b) {
	}
	Line() {
	}
} l[N], l4[N][2];
double eps(1e-10);
__inline int sign(const double & x) {
	return fabs(x) <= eps ? 0 : (x > 0 ? 1 : -1); 
}
__inline bool equal(const double & a, const double & b) {
	return sign(a - b) == 0;
}
__inline Point operator + (const Point & a, const Point & b) {
	return Point(a.x + b.x, a.y + b.y);
}
__inline Point operator - (const Point & a, const Point & b) {
	return Point(a.x - b.x, a.y - b.y);
}
__inline Point operator * (const double & a, const Point & b) {
	return Point(a * b.x, a * b.y);
}
__inline double operator * (const Point & a, const Point & b) {
	return a.x * b.y - a.y * b.x;
}
__inline double operator % (const Point & a, const Point & b) {
	return a.x * b.x + a.y * b.y;
}
__inline Point intersection(const Line & a, const Line & b) {
	double lambda((b.s - a.s) * b.d / (a.d * b.d));
	return a.s + lambda * a.d;
}
__inline double dis(const Point & a, const Point & s, const Point & t) {
	return fabs((s - a) * (s - t)) / (s - t).len();
}
__inline bool operator < (const Point & a, const Point & b) {
	if(!equal(a.x, b.x)) {
		return a.x < b.x;
	}
	if(!equal(a.y, b.y)) {
		return a.y < b.y;
	}
	return false;
}
int main() {
	int n;
	for(int _ = 1; ; _++) {
		scanf("%d", &n);
		if(n == 0) {
			break;
		}
		for(int i(1); i <= n; i++) {
			s[i].scan();
			t[i].scan();
		}
		if(n <= 2) {
			printf("Many\n");
			continue;
		}
		for(int i(1); i <= 3; i++) {
			l[i] = Line(s[i], t[i] - s[i]);
		}
		for(int i(1); i <= 2; i++) {
			if(sign(l[i].d * l[i + 1].d) == 0) {
				l4[i][0] = l4[i][1] = Line(0.5 * (l[i].s + l[i + 1].s), l[i].d);
			}else {
				l4[i][0] = Line(intersection(l[i], l[i + 1]), 0.5 * (l[i].d.zoom(1) + l[i + 1].d.zoom(1)));
				l4[i][1] = Line(intersection(l[i], l[i + 1]), 0.5 * (l[i].d.zoom(-1) + l[i + 1].d.zoom(1)));
			}
		}
		set<Point> st;
		for(int i(0); i < 2; i++) {
			for(int j(0); j < 2; j++) {
				if(sign(l4[1][i].d * l4[2][j].d) != 0) {
					Point p(intersection(l4[1][i], l4[2][j]));
					double d(dis(p, s[1], t[1]));
					bool flag(true);
					for(int k(2); k <= n; k++) {
						double d1(dis(p, s[k], t[k]));
						if(!equal(d1, d)) {
							flag = false;
							break;
						}
					}
					if(flag) {
						st.insert(p);
					}
				}
			}
		}
		if(st.size() == 0) {
			printf("None\n");
		}else if(st.size() >= 2) {
			printf("Many\n");
		}else if(st.size() == 1) {
			st.begin()->print();
		}
	}
}