#include <bits/stdc++.h>
using namespace std;
long long int llin() {
  long long int x;
  scanf("%lld", &x);
  return x;
}
long double ldin() {
  long double x;
  scanf("%Lf", &x);
  return x;
}
char chin() {
  char ch;
  cin >> ch;
  return ch;
}
string strin() {
  string str;
  cin >> str;
  return str;
}
void No() { cout << "No" << endl; }
void NO() { cout << "NO" << endl; }
void Yes() { cout << "Yes" << endl; }
void YES() { cout << "YES" << endl; }
long long int fmin_i(vector<long long int> v) {
  long long int n = v.size(), mn_i = 0, mn_e = v[0];
  for (long long int i = 0; i <= n - 1; i++) {
    long long int MIN = min(mn_e, v[i]);
    if (MIN != mn_e) {
      mn_e = MIN;
      mn_i = i;
    }
  }
  return mn_i;
}
long long int fmax_i(vector<long long int> v) {
  long long int n = v.size(), mx_i = 0, mx_e = v[0];
  for (long long int i = 0; i <= n - 1; i++) {
    long long int MAX = max(mx_e, v[i]);
    if (MAX != mx_e) {
      mx_e = MAX;
      mx_i = i;
    }
  }
  return mx_i;
}
long long int lmin_i(vector<long long int> v) {
  long long int n = v.size(), mn_i = 0, mn_e = v[0];
  for (long long int i = 0; i <= n - 1; i++) {
    if (v[i] <= mn_e) {
      mn_e = v[i];
      mn_i = i;
    }
  }
  return mn_i;
}
long long int lmax_i(vector<long long int> v) {
  long long int n = v.size(), mx_i = 0, mx_e = v[0];
  for (long long int i = 0; i <= n - 1; i++) {
    if (v[i] >= mx_e) {
      mx_e = v[i];
      mx_i = i;
    }
  }
  return mx_i;
}
long long int min_e(vector<long long int> v) {
  long long int mn_e = v[0], n = v.size();
  for (long long int i = 0; i <= n - 1; i++) mn_e = min(mn_e, v[i]);
  return mn_e;
}
long long int max_e(vector<long long int> v) {
  long long int mx_e = v[0], n = v.size();
  for (long long int i = 0; i <= n - 1; i++) mx_e = max(mx_e, v[i]);
  return mx_e;
}
void make_prime(vector<bool>& v) {
  long long int I = 2, n = (long long int)v.size() - 1;
  for (long long int i = 0; i <= n; i++) v[i] = true;
  v[0] = false;
  v[1] = false;
  while (I <= n) {
    while (I <= n && !v[I]) I++;
    if (I > n) break;
    long long int i = 2;
    while (i * I <= n) {
      v[i * I] = false;
      i++;
    }
    I++;
  }
}
int main() {
  long double a = ldin(), b = ldin(), c = ldin(), d = ldin();
  long double p1 = max(3 * a / 10, a - (a / 250) * c);
  long double p2 = max(3 * b / 10, b - (b / 250) * d);
  if (p1 > p2)
    cout << "Misha";
  else if (p2 > p1)
    cout << "Vasya";
  else
    cout << "Tie";
}
