#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1};
long long int C(int n, int k) {
  long long ans = 1;
  k = k > n - k ? n - k : k;
  int j = 1;
  for (; j <= k; j++, n--) {
    if (n % j == 0) {
      ans *= n / j;
    } else if (ans % j == 0) {
      ans = ans / j * n;
    } else {
      ans = (ans * n) / j;
    }
  }
  return ans;
}
long long int powmod(long long int a, long long int b) {
  long long int res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0)
    return (b);
  else
    return (gcd(b % a, a));
}
long long int powmod(long long int a, long long int b, long long int m) {
  long long int res = 1;
  a %= m;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
  }
  return res;
}
int main() {
  int a, b, c, d;
  cin >> a >> b >> c >> d;
  int val1 = max((3 * a / 10), (a - (a / 250) * c));
  int val2 = max((3 * b / 10), (b - (b / 250) * d));
  if (val1 < val2) {
    cout << "Vasya" << endl;
  } else if (val2 < val1)
    cout << "Misha" << endl;
  else
    cout << "Tie" << endl;
  return 0;
}
