Misha and Vasya participated in a Codeforces contest. Unfortunately, each of them solved only one problem, though successfully submitted it at the first attempt. Misha solved the problem that costs *a* points and Vasya solved the problem that costs *b* points. Besides, Misha submitted the problem *c* minutes after the contest started and Vasya submitted the problem *d* minutes after the contest started. As you know, on Codeforces the cost of a problem reduces as a round continues. That is, if you submit a problem that costs *p* points *t* minutes after the contest started, you get <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/e7bb7983e9c15baf66651c7643406c249354c8c1.png" style="max-width: 100.0%;max-height: 100.0%;"/> points. 

Misha and Vasya are having an argument trying to find out who got more points. Help them to find out the truth.
The first line contains four integers *a*, *b*, *c*, *d* (250 ≤ *a*, *b* ≤ 3500, 0 ≤ *c*, *d* ≤ 180). 

It is guaranteed that numbers *a* and *b* are divisible by 250 (just like on any real Codeforces round).
from sys import path_hooks, stdin, stdout
from collections import Counter,deque
import math
from copy import deepcopy
import random
import heapq
import sys
sys.setrecursionlimit(10**5)

 
def mapinput():
    return  map(int, stdin.readline().split())

def strinput():
    return stdin.readline().strip()

def listinput():
    return list(map(int,stdin.readline().split()))

def intinput():
    return int(stdin.readline().strip())

# int(stdin.readline().strip())
# stdin.readline().strip()
# list(map(int,stdin.readline().split()))
# map(int,stdin.readline().split())
'''
n = int(stdin.readline())
s = stdin.readline().strip()
n, k = map(int, stdin.readline().split())
arn = list(map(int, stdin.readline().split()))
'''

def gcd(a,b):
    if(b==0):
        return a
    else:
        return gcd(b,a%b)

def SieveOfEratosthenes(n):
    prime = [True for i in range(n + 1)]
    p = 2
    while (p * p <= n):
        if (prime[p] == True):
            for i in range(p * 2, n + 1, p):
                prime[i] = False
        p += 1
    prime[0]= False
    prime[1]= False
    ans = []
    for p in range(n + 1):
        if prime[p]:
            ans.append(p)
    return ans

coprime1 = {6: 100003, 5: 10007, 4: 1009, 3: 101, 2: 11, 1: 2, 7: 1000003, 8: 10000019, 9: 100000007}
coprime2 = {8:10000169,9:100000049,7:1000033,6:100019,5:10009,4:1013,3:103,2:13,1:3}
 
def writ(ss):
    stdout.write(str(ss) + "\n")

mod = (10 **9) + 7

def sumn(n):
    return (n*(n+1))//2

for test in range(1):
    def solve():
        a,b,c,d = mapinput()
        mis = max( 3*a / 10 , a/250 * c  )
        vas = max( 3*b / 10 , b/250 * d  )
        if vas> mis:
            return "Vasya"
        elif mis > vas:
            return "Misha"
        else:
            return "Tie"
    print(solve())