#include <iostream>
#include <iomanip>
#include <complex>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
using namespace std;
 
const double EPS = 1e-8;
const double INF = 1e12;
#define EQ(n,m) (abs((n)-(m)) < EPS)
#define X real()
#define Y imag()
 
typedef complex<double> P;
typedef vector<P> VP;
struct L : array<P, 2>{
    L(const P& a, const P& b){ at(0)=a; at(1)=b; }
    L(){}
};
 
namespace std{
    bool operator < (const P& a, const P& b){
        return (a.X!=b.X) ? a.X<b.X : a.Y<b.Y;
    }
    bool operator == (const P& a, const P& b){
        return abs(a-b) < EPS;
    }
}
 
double dot(P a, P b){
    return (conj(a)*b).X;
}
double cross(P a, P b){
    return (conj(a)*b).Y;
}
P unit(const P &p){
    return p/abs(p);
}

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]);
}
 
double distanceLP(const L &l, const P &p) {
  return abs(p - projection(l, p));
}

P crosspointLL(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]);
  return m[0] + B/A *(m[1]-m[0]);
}
 
bool isParallel(const P &a, const P &b){
    return abs(cross(a,b)) < EPS;
}
bool isParallel(const L &a, const L &b){
    return isParallel(a[1]-a[0], b[1]-b[0]);
}
vector<L> equidist(const L &a, const L &b){
    vector<L> ret;
    if(isParallel(a, b)){
        P mid = (a[0]+b[0])/2.0;
        ret.push_back( L(mid, mid+(a[1]-a[0])) );
    }else{
        P cp = crosspointLL(a, b);
        P v1 = unit(a[1]-a[0])*1000.0, v2 = unit(b[1]-b[0])*1000.0;
        ret.push_back( L(cp, cp+ (v1+v2)/2.0) );
        ret.push_back( L(cp, cp+ (v1-v2)/2.0) );
    }
    return ret;
}

int main(){
    while(1){
        int n;
        cin >> n;
        if(n==0) break;
         
        vector<L> l(n);
        for(int i=0; i<n; i++){
            int x1,y1,x2,y2;
            cin >> x1 >> y1 >> x2 >> y2;
            l[i] = L(P(x1,y1), P(x2,y2));
        }

        if(n <= 2){
            cout << "Many" << endl;
            continue;
        }else if(isParallel(l[0], l[1]) && isParallel(l[1], l[2])){
            cout << "None" << endl;
            continue;
        }

        vector<L> ml;
        for(int i=0; i<3; i++){
            vector<L> cl = equidist(l[i], l[(i+1)%3]);
            copy(cl.begin(), cl.end(), back_inserter(ml));
        }
        VP cand;
        for(int i=0; i<(int)ml.size(); i++){
            for(int j=i+1; j<(int)ml.size(); j++){
                if(!isParallel(ml[i], ml[j])){
                    cand.push_back(crosspointLL(ml[i], ml[j]));
                }
            }
        }
        sort(cand.begin(), cand.end());
        cand.erase(unique(cand.begin(), cand.end()), cand.end());

        int count = 0;
        P ans;
        for(int i=0; i<(int)cand.size(); i++){
            bool success = true;
            double dist = distanceLP(l[0], cand[i]);
            for(int j=1; j<n; j++){
                if(!EQ(dist, distanceLP(l[j], cand[i]))){
                    success = false;
                    break;
                }
            }
            if(success){
                count++;
                ans = cand[i];
            }
        }

        if(count==0){
            cout << "None" << endl;
        }else if(count >= 2){
            cout << "Many" << endl;
        }else{
            cout << fixed;
            cout << setprecision(10);
            cout << ans.X << " " << ans.Y << endl;
        }
    }
    return 0;
}

