#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <climits>
#include <queue>
#include <set>
#include <map>
#include <valarray>
#include <bitset>
#include <stack>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 1<<29;
const double PI = acos(-1);
const double EPS = 1e-10;

typedef complex<double> P;
namespace std {
  bool operator < (const P& a, const P& b) {
    if (abs(a-b)<1e-10) return 0;
    return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
  }
}
double cross(const P& a, const P& b) {
  return imag(conj(a)*b);
}
double dot(const P& a, const P& b) {
  return real(conj(a)*b);
}
struct L : public vector<P> {
  L(const P &a, const P &b) {
    push_back(a); push_back(b);
  }
  L() {}
};
typedef vector<P> G;
#define curr(P, i) P[i]
#define next(P, i) P[(i+1)%P.size()]
struct C {
  P p; double r;
  C(const P &p, double r) : p(p), r(r) { }
};

int ccw(P a, P b, P c) {
  b -= a; c -= a;
  if (cross(b, c) > 0)   return +1;       // counter clockwise
  if (cross(b, c) < 0)   return -1;       // clockwise
  if (dot(b, c) < 0)     return +2;       // c--a--b on line
  if (norm(b) < norm(c)) return -2;       // a--b--c on line
  return 0;
}
P projection(const L &l, const P &p) {
  double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);
  return l[0] + t*(l[0]-l[1]);
}
P crosspoint(const L &l, const L &m) {
  double A = cross(l[1] - l[0], m[1] - m[0]);
  double B = cross(l[1] - l[0], l[1] - m[0]);
  if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line
  if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!
  return m[0] + B / A * (m[1] - m[0]);
}
bool intersectLL(const L &l, const L &m) {
  return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS || // non-parallel
         abs(cross(l[1]-l[0], m[0]-l[0])) < EPS;   // same line
}

double distanceLP(const L &l, const P &p) {
  return abs(p - projection(l, p));
}
P normalize(P p) {
  return p/abs(p);
}
vector<L> angleBisector(const L &l, const L &m) {
  vector<L> res;
  if (abs(cross(l[1]-l[0], m[1]-m[0])) > EPS) { // non-parallel
    P p1 = crosspoint(l,m);
    P p2 = p1+(normalize(l[1]-l[0]) + normalize(m[1]-m[0]))*0.5;
    res.push_back(L(p1,p2));
    p2 = p1+(normalize(l[1]-l[0]) + normalize(m[0]-m[1]))*0.5;
    res.push_back(L(p1,p2));
  } else {                      
    P p1 = (projection(l,m[0])+m[0])*0.5;
    res.push_back(L(p1,p1+l[1]-l[0]));
  }
  
  return res;
}
int main() {
  int n;
  int hoge = 0;
  while(cin>>n,n) {
    //if (hoge++) break;
    vector<L> v;
    REP(i,n) {
      P p1, p2;
      cin>>p1.real()>>p1.imag()>>p2.real()>>p2.imag();
      v.push_back(L(p1,p2));
    }
    // FOR(it, v) {
    //   FOR(jt, v) {
    //     if (*it == *jt) continue;
    //     if (intersectLL(*it,*jt))
    //         cout << crosspoint(*it, *jt) << endl;
    //   }
    // }
    if (n<=2) {
      cout << "Many" << endl;
      continue;
    }
    vector<L> vl1 = angleBisector(v[0],v[1]);
    vector<L> vl2 = angleBisector(v[0],v[2]);
    set<P> se;
    FOR(it, vl1) FOR(jt, vl2) {
      //cout << (*it)[0] << " " << (*it)[1] << ",  " << (*jt)[0] << " " << (*jt)[1] << endl;
      if (intersectLL(*it,*jt))
        se.insert(crosspoint(*it,*jt));
    }
    vector<P> ans;
    FOR(it, se) {
      double d = -1;
      bool dame = 0;
      FOR(jt, v) {
        if (d == -1) d = distanceLP(*jt, *it);
        else if (abs(d-distanceLP(*jt,*it))>1e-6) {
          dame = 1;
          break;
        }
      }
      if (!dame) ans.push_back(*it);
    }
    // cout << "se"  << endl; FOR(it, se ) cout << *it << endl;
    // cout << "ans" << endl; FOR(it, ans) cout << *it << endl;
    if (ans.size() > 1) cout << "Many" << endl;
    else if (ans.size() == 0) cout << "None" << endl;
    else {
      printf("%.5f %.5f\n", ans[0].real(), ans[0].imag());
    }
  }
}

Measured memory_bytes: 0