#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
//{{{ templates
#define TT_ template<typename T>inline
#define TTF_ template<typename T,typename F>inline
TT_ T sq(T x){return x*x;}
TT_ T In(){T x;cin>>x;return x;}
TT_ void Out(T&x){cout<<x;}
TT_ void sort(T&v){sort(begin(v),end(v));}
TT_ void revs(T&v){reverse(begin(v),end(v));}
TT_ void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}
TT_ int ubnd(T&v,typename T::value_type x){return upper_bound(begin(v),end(v),x)-begin(v);}
TT_ int lbnd(T&v,typename T::value_type x){return lower_bound(begin(v),end(v),x)-begin(v);}
TTF_ void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}
TTF_ void show(T&v,F f,string d=" ",string e="\n"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}
TT_ typename T::iterator minel(T&v){return min_element(begin(v),end(v));}
TT_ typename T::iterator maxel(T&v){return max_element(begin(v),end(v));}

inline void fast_io(){ios_base::sync_with_stdio(0);cin.tie(0);}
inline int in(){int x;scanf("%d",&x);return x;}
inline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}
inline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}
//}}} priority_queue queue deque front stringstream max_element min_element insert count make_tuple

const ld EPS = 1e-10;

typedef valarray<ld> point;

ld dot(const point& a, const point& b){
  return (a * b).sum();
}
point cross(const point& a, const point& b){
  return a.cshift(1) * b.cshift(-1) - a.cshift(-1) * b.cshift(1);
}
ld norm(const point& a, const point& b){
  return dot(a - b, a - b);
}

bool in_tri(const point& a, const point& b, const point& c, const point& x)
{
  auto c1 = cross(x - a, b - a);
  if (dot(c1, cross(x - b, c - b)) < EPS) return false;
  if (dot(c1, cross(x - c, a - c)) < EPS) return false;
  return true;
}

int main()
{
  point uaz(3), enemy(3), v1(3), v2(3), v3(3);
  for (int i = 0; i < 3; i++) cin >> uaz[i];
  for (int i = 0; i < 3; i++) cin >> enemy[i];
  for (int i = 0; i < 3; i++) cin >> v1[i];
  for (int i = 0; i < 3; i++) cin >> v2[i];
  for (int i = 0; i < 3; i++) cin >> v3[i];
  point v = uaz - enemy;
  point n = cross(v2 - v1, v3 - v2);
  ld x = dot(uaz - v1, n), y = dot(v, n);
  bool ok = false;
  ld t = x / y;
  if (t > EPS){
    point p = uaz - t * v;
    ok = in_tri(v1, v2, v3, p);
  }
  if (ok) puts("MISS");
  else puts("HIT");

  return 0;
}