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).
'''
import string

n= int(input())
x=[]
for i in range(0,n):
    x.append(input())

for i in range(0,n):
    l=len(x[i])-1
    if l<10:
        print(x[i])
    else:
        print("%s%i%s" % (x[i][0],l-1,x[i][l]))
        



n= int(input())
s=0
for i in range(0,n):
    inp = list(map(int,input().split()))
    if inp[0]+inp[1]+inp[2]>=2:
        s+=1     
print(s)
'''

'''
n= int(input())
for i in range(0,n):
    inp = list(map(int,input().split()))
    if inp[0]==inp[1]: print("0\n")
    elif inp[0]<inp[1] :
        if (inp[0]-inp[1])%2 : print("1\n")
        else : print("2\n")
    else : 
        if (inp[1]-inp[0])%2 : print("2\n")
        else: print("1\n")
'''

inp = list(map(int,input().split()))
mishaPoint = max((3*inp[0])/10,inp[0]-((inp[0]*inp[2])/250))
vasyaPoint = max((3*inp[1])/10,inp[1]-((inp[1]*inp[3])/250))
if mishaPoint>vasyaPoint : print("Misha")
elif mishaPoint <  vasyaPoint : print("Vasya")
else : print("Tie")
