#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<deque>
#include<queue>
#include<cmath>
#include<cassert>
#include<cstring>
#include<climits>
#include<map>
#include<set>

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define ALL(x) x.begin(),x.end()
#define EPS (1e-8)
#define equals(a,b) (fabs((a)-(b)) < EPS)
#define COUNTER_CLOCKWISE 1
#define CLOCKWISE -1 
#define ONLINE_BACK 2
#define ONLINE_FRONT -2
#define ON_SEGMENT 0

using namespace std;

class Point{
public:
  double x,y;

  Point(double x = 0,double y = 0): x(x),y(y){}

  Point operator + (Point p){return Point(x+p.x,y+p.y);}
  Point operator - (Point p){return Point(x-p.x,y-p.y);}
  Point operator * (double a){return Point(a*x,a*y);}
  Point operator / (double a){return Point(x/a,y/a);}
  Point operator * (Point a){ return Point(x * a.x - y * a.y, x * a.y + y * a.x); }

  bool operator < (const Point& p) const{ return !equals(x,p.x)?x<p.x:(!equals(y,p.y)&&y<p.y); }

  bool operator == (const Point& p)const{ return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS; }

};

struct Segment{
  Point p1,p2;
  Segment(Point p1 = Point(),Point p2 = Point()):p1(p1),p2(p2){}
  bool operator <  (const Segment& s) const { return ( p2 == s.p2 ) ? p1 < s.p1 : p2 < s.p2; }
  bool operator == (const Segment& s) const { return ( s.p1 == p1 && s.p2 == p2 ) || ( s.p1 == p2 && s.p2 == p1 ); }

};

typedef Point Vector;
typedef Segment Line;
typedef vector<Point> Polygon;

ostream& operator << (ostream& os,const Point& a){ return os << "(" << a.x << "," << a.y << ")"; }

ostream& operator << (ostream& os,const Segment& a){ return os << "( " << a.p1 << " , " << a.p2 << " )"; }

double dot(Point a,Point b){ return a.x*b.x + a.y*b.y; }

double cross(Point a,Point b){ return a.x*b.y - a.y*b.x; }

double norm(Point a){ return a.x*a.x+a.y*a.y; }

double abs(Point a){ return sqrt(norm(a)); }

//rad ????§???????????????¢?????§?????????????????¨
Point rotate(Point a,double rad){ return Point(cos(rad)*a.x - sin(rad)*a.y,sin(rad)*a.x + cos(rad)*a.y); }

// ??????????????¢????????????
double toRad(double agl){ return agl*M_PI/180.0; }

// a => prev, b => cur, c=> next
// prev ?????? cur ????????£??? next ????????????????§????????±???????
double getArg(Point a,Point b,Point c){
  double arg1 = atan2(b.y-a.y,b.x-a.x);
  double arg2 = atan2(c.y-b.y,c.x-b.x);
  double arg = fabs( arg1 - arg2 );
  while( arg > M_PI ) arg -= 2.0 * M_PI;
  return fabs(arg);
}

int ccw(Point p0,Point p1,Point p2){
  Point a = p1-p0;
  Point b = p2-p0;
  if(cross(a,b) > EPS)return COUNTER_CLOCKWISE;
  if(cross(a,b) < -EPS)return CLOCKWISE;
  if(dot(a,b) < -EPS)return ONLINE_BACK;
  if(norm(a) < norm(b))return ONLINE_FRONT;
  return ON_SEGMENT;
}

bool intersectLL(Line l, Line m) {
  return abs(cross(l.p2-l.p1, m.p2-m.p1)) > EPS || // non-parallel
         abs(cross(l.p2-l.p1, m.p1-l.p1)) < EPS;   // same line
}
bool intersectLS(Line l, Line s) {
  return cross(l.p2-l.p1, s.p1-l.p1)*       // s[0] is left of l
         cross(l.p2-l.p1, s.p2-l.p1) < EPS; // s[1] is right of l
}
bool intersectLP(Line l,Point p) {
  return abs(cross(l.p2-p, l.p1-p)) < EPS;
}
bool intersectSS(Line s, Line t) {
  return ccw(s.p1,s.p2,t.p1)*ccw(s.p1,s.p2,t.p2) <= 0 &&
         ccw(t.p1,t.p2,s.p1)*ccw(t.p1,t.p2,s.p2) <= 0;
}
bool intersectSP(Line s, Point p) {
  return abs(s.p1-p)+abs(s.p2-p)-abs(s.p2-s.p1) < EPS; // triangle inequality
}

Point projection(Line l,Point p) {
  double t = dot(p-l.p1, l.p1-l.p2) / norm(l.p1-l.p2);
  return l.p1 + (l.p1-l.p2)*t;
}
Point reflection(Line l,Point p) {
  return p + (projection(l, p) - p) * 2;
}
double distanceLP(Line l, Point p) {
  return abs(p - projection(l, p));
}
double distanceLL(Line l, Line m) {
  return intersectLL(l, m) ? 0 : distanceLP(l, m.p1);
}

double distanceLS(Line l, Line s) {
  if (intersectLS(l, s)) return 0;
  return min(distanceLP(l, s.p1), distanceLP(l, s.p2));
}
double distanceSP(Line s, Point p) {
  Point r = projection(s, p);
  if (intersectSP(s, r)) return abs(r - p);
  return min(abs(s.p1 - p), abs(s.p2 - p));
}

double distanceSS(Line s, Line t) {
  if (intersectSS(s, t)) return 0;
  return min(min(distanceSP(s, t.p1), distanceSP(s, t.p2)),
             min(distanceSP(t, s.p1), distanceSP(t, s.p2)));
}

Point crosspoint(Line l,Line m){
  double A = cross(l.p2-l.p1,m.p2-m.p1);
  double B = cross(l.p2-l.p1,l.p2-m.p1);
  if(abs(A) < EPS && abs(B) < EPS){
    vector<Point> vec;
    vec.push_back(l.p1),vec.push_back(l.p2),vec.push_back(m.p1),vec.push_back(m.p2);
    sort(vec.begin(),vec.end());
    assert(vec[1] == vec[2]); //???????????°??????????????????
    return vec[1];
    //return m.p1;
  }
  if(abs(A) < EPS)assert(false);
  return m.p1 + (m.p2-m.p1)*(B/A);
}




Point ps[2][3];

const double coef = 1e4;
bool canMove(vector<Point> &tri,int sp,Point p) {
  Vector v;
  Point a = tri[(sp+1)%3], b = tri[(sp+2)%3];
  v = ( a - b ) / abs( a - b );
  Line l = Line(tri[sp]-v*coef,tri[sp]+v*coef);
  return equals(distanceLP(l,p),0.0);
}

bool check(vector<Point> &p1,vector<Point> &p2) {
  vector<int> perm[2];
  rep(i,2) rep(j,3) perm[i].push_back(j);
  do {
    do {
      vector<Point> tri[2];
      rep(i,3) tri[0].push_back(p1[perm[0][i]]);
      rep(i,3) tri[1].push_back(p2[perm[1][i]]);
      bool success = true;
      rep(i,3) {
	if( canMove(tri[0],i,tri[1][i]) ) {
	  tri[0][i] = tri[1][i];
	} else {
	  success = false;
	  break;
	}
      }
      if( success ) return true;
    } while( next_permutation(ALL(perm[1])) );
    sort(ALL(perm[1]));
  } while( next_permutation(ALL(perm[0])) );
  return false;
}

void compute() {
  rep(__,2) {
    vector<Point> p1,p2;
    rep(i,3) p1.push_back(ps[0][i]);
    rep(i,3) p2.push_back(ps[1][i]);
    if( __ ) swap(p1,p2);

    // 3
    if( check(p1,p2) ) { puts("3"); return; }

    // 4
    rep(i,3) rep(j,3) {
      Vector v = ( p1[i] - p2[j] ) / abs( p1[i] - p2[j] );
      int _5ds[2] = { (i+1)%3, (i+2)%3 };
      rep(_,2) {
	vector<Point> tri[2];
	rep(l,3) tri[0].push_back(p1[l]);
	rep(l,3) tri[1].push_back(p2[l]);
	Line l = Line( p1[_5ds[0]] - v * coef, p1[_5ds[0]] + v * coef );
	Vector v2 = ( p1[i] - p1[_5ds[0]] ) / abs( p1[i] - p1[_5ds[0]] );
	Line m = Line( p1[_5ds[1]] - v2 * coef, p1[_5ds[1]] + v2 * coef );
	if( equals(cross(l.p1-l.p2,m.p1-m.p2),0.0) ) continue;
	Point cp = crosspoint(l,m);
	tri[0][_5ds[1]] = cp;
	if( check(tri[0],tri[1]) ) { puts("4"); return; }
	swap(_5ds[0],_5ds[1]);
      }
    }
  }
  // 10 or more
  puts("Many");
}

int main() {
  while( cin >> ps[0][0].x >> ps[0][0].y ) {
    REP(i,1,3) cin >> ps[0][i].x >> ps[0][i].y;
    rep(i,3) cin >> ps[1][i].x >> ps[1][i].y;
    compute();
  }
  return 0;
}

Measured memory_bytes: 3224