#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)

#define OUT 0
#define ON 1
#define IN 2
#define EPS (1e-5)
class P{                    //点
public:
    double x,y;
    
    P(double _x=0,double _y=0):x(_x),y(_y){};
    P operator + (const P &p     )const{ return P( x+p.x , y+p.y ); }  //加算
    P operator - (const P &p     )const{ return P( x-p.x , y-p.y ); }  //減算
    P operator * (const double k )const{ return P( x*k   , y*k    ); } //乗算
    P operator / (const double k )const{ return P( x/k   , y/k    ); } //除算
    
    bool operator == (const P &p){ return ( fabs(x-p.x)<EPS && fabs(y-p.y)<EPS ); }
    bool operator < (const P &p) const{ return ( x!=p.x ? x<p.x:y<p.y ); }
    
    double norm(){ return x*x+y*y; }        //ノルム
    double abs() { return sqrt(norm()); }   //大きさ
    void normalize() {double d = sqrt(x*x+y*y); x /= d; y /= d;}    //正規化
};
struct C{P p;double r;};    //円
struct S{P p1,p2;};         //線分
typedef vector<P> Polygon;  //多角形
typedef P Vector;           //ベクトル
typedef S L;                //直線

double norm (P p)               { return p.norm(); }
double abs  (P p)               { return p.abs(); }
double dot  (Vector a,Vector b) { return a.x*b.x+a.y*b.y; }
double cross(Vector a,Vector b) { return a.x*b.y-a.y*b.x; }
double sqDist(P a, P b)         {return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);}
double dist (P a, P b)          {return sqrt(sqDist(a,b));}
Vector vec(S a)                 {return P(a.p2.x-a.p1.x,a.p2.y-a.p1.y);}

// 直線と直線の交点 vefiried AOJ CGL_2
P getCrossPointSS(S l1, S l2){
    double A = cross(vec(l1), vec(l2));
    double B = cross(vec(l1), l1.p2 - l2.p1);
    if(abs(A)<EPS && abs(B)<EPS) return l2.p1; // 二直線が重なっている
    if(abs(A)<EPS) return P(INF,INF); // 直線が交わらない
    return l2.p1 + vec(l2) * B / A;
}

//線分と点の距離 verified ARC042-B
double dLP(S l, P p) { return abs(cross(l.p2-l.p1, p-l.p1)) /(l.p2-l.p1).abs(); }



bool isParallel(L a, L b){
    if(cross(vec(a),vec(b))<EPS){
        return true;
    }else{
        return false;
    }
}

//線分に対する点の射影 verified AOJ CGL_1_A
P projection(S s, P p){
    Vector base = s.p2-s.p1;
    double r = dot(p-s.p1, base)/norm(base);
    return (base*r)+s.p1;
}

P normalize(P p) {
    return p/abs(p);
}
vector<L> angle_bisector(const L &l, const L &m) {
    vector<L> res;
    if (abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS) { // non-parallel
        P pos1 = getCrossPointSS(l,m);
        P pos2 = pos1+(normalize(l.p2-l.p1) + normalize(m.p2-m.p1))*0.5;
        res.push_back(L{pos1,pos2});
        pos2 = pos1+(normalize(l.p2-l.p1) + normalize(m.p1-m.p2))*0.5;
        res.push_back(L{pos1,pos2});
        
    } else {
        P pos1 = (projection(l,m.p1)+m.p1)*0.5;
        res.push_back(L{pos1,pos1+l.p2-l.p1});
    }
    
    return res;
}

int main(){
    int n;
    while(cin>>n&&n){
        vector<L> lines(n);
        rep(i,n){
            P p1,p2;
            cin>>p1.x>>p1.y>>p2.x>>p2.y;
            lines[i] = L{p1, p2};
        }
        
        if(n<=2){ cout<<"Many"<<endl; }
        else{
            vector<L> ls[2];
            
            ls[0] = angle_bisector(lines[0], lines[1]);
            ls[1] = angle_bisector(lines[1], lines[2]);
            
            vector<P> vp;
            rep(i,ls[0].size()){
                rep(j,ls[1].size()){
                    vp.pb( getCrossPointSS(ls[0][i], ls[1][j]) );
                }
            }
            sort(all(vp));
            vector<P> v;
            v.pb(vp[0]);
            rep(i,vp.size()-1){
                P t = vp[i]-vp[i+1];
                if( (t.x)<(1e-12) && abs(t.y)<(1e-12) )continue;
                v.pb(vp[i+1]);
            }
            vp = v;
            rep(i,vp.size()-1){
                P t = vp[i]-vp[i+1];
                assert( abs(t.x)>(1e-12) || abs(t.y)>(1e-12) );
            }
            
            vector<P> ans;
            for(auto elm:vp){
                
                bool flag = true;
                for(int i=1;i<n;i++){
                    if( abs(dLP(lines[0],elm) - dLP(lines[i],elm))<EPS ){
                        ;
                    }else{
                        flag = false;
                    }
                }
                if(flag){
                    ans.pb(elm);
                }
            }
            if(ans.size()>1){
                cout<<"Many"<<endl;
            }else if(ans.size()==1){
                printf("%.20lf %.20lf\n",ans[0].x, ans[0].y);
            }else{
                cout<<"None"<<endl;
            }
        }
    }
}




Measured memory_bytes: 3236