#include <bits/stdc++.h>
using namespace std;
namespace patch {
template <typename T>
std::string to_string(const T &n) {
  std::ostringstream stm;
  stm << n;
  return stm.str();
}
}  // namespace patch
long long findgcd(long long a, long long b) {
  if (b == 0) return a;
  return findgcd(b, a % b);
}
long long minm(long long a, long long b) { return !(b < a) ? a : b; }
bool primetest(long long a) {
  for (size_t i = 2; i <= sqrt(a); i++) {
    if (a % i == 0) return true;
  }
  return false;
}
long long *sort_descending(long long *array, long long start, long long end) {
  sort(array + start, array + end + 1, std::greater<long long>());
  return array;
}
long long maxm(long long a, long long b) { return !(b > a) ? a : b; }
long long nCk_dp_array[60][60] = {{0}};
long long nCk_dp_for_non_fixed_n_k(long long n, long long k) {
  nCk_dp_array[0][0] = 1;
  for (size_t i = 0; i <= n; i++) {
    for (size_t j = 0; j <= i; j++) {
      if (j == 0 || j == i) {
        nCk_dp_array[i][j] = 1;
      } else {
        nCk_dp_array[i][j] =
            nCk_dp_array[i - 1][j - 1] + nCk_dp_array[i - 1][j];
      }
    }
  }
  return nCk_dp_array[n][k];
}
long long modular_exponential(long long base, long long exponent,
                              long long modulus) {
  long long result = 1;
  while (exponent > 0) {
    if (exponent % 2 == 1) result = (result * base) % modulus;
    exponent = exponent >> 1;
    base = (base * base) % modulus;
  }
  return result;
}
string toLower(string s) {
  int i;
  for (i = 0; i <= s.length(); i++) {
    if (s[i] >= 65 && s[i] <= 92) {
      s[i] = s[i] + 32;
    }
  }
  return s;
}
bool isSubSequence(string str1, string str2, int m, int n) {
  if (m == 0) return true;
  if (n == 0) return false;
  if (str1[m - 1] == str2[n - 1])
    return isSubSequence(str1, str2, m - 1, n - 1);
  return isSubSequence(str1, str2, m, n - 1);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long a, b, c, d;
  cin >> a >> b >> c >> d;
  if (max((3 * a) / 10, a - (a / 250) * c) >
      max((3 * b) / 10, b - (b / 250) * d))
    cout << "Misha" << endl;
  if (max((3 * a) / 10, a - (a / 250) * c) <
      max((3 * b) / 10, b - (b / 250) * d))
    cout << "Vasya" << endl;
  if (max((3 * a) / 10, a - (a / 250) * c) ==
      max((3 * b) / 10, b - (b / 250) * d))
    cout << "Tie" << endl;
  return 0;
}
