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).
# A.Contest

def points(points_in,time):

    
    points_out=max((3*points_in)/10,(points_in-points_in/250*time))

    return(points_out)


Misha_points,Vasya_points,Misha_time,Vasya_time = map(int,input().split())

points_misha=points(Misha_points,Misha_time)
points_vasya=points(Vasya_points,Vasya_time)

if points_misha > points_vasya:
    print('Misha')
elif points_vasya > points_misha:
    print('Vasya')
else:
    print('Tie')





"""
# Twins

n = int(input())
coin_values = sorted(list(map(int,input().split())),reverse=True)

sum_coins=sum(coin_values)

#print(sum_coins)
money = 0
coins = 0
for idx,value in enumerate(coin_values):

    #print('money: '+str(money))
    #print('value of next coin: '+str(value))

    if (money <= sum_coins / 2):
        money = money + value
        coins += 1
        
    if money > sum_coins /2:
        coins_min = coins
        #print('coins min: '+str(coins_min))
        #print(money)
        money = money - value
        break
        coins -= 1



print(coins_min)
    
    

#for value in coin_values
"""

""" Domino piling
import math

X, Y = map(int,input().split())
p_in_x=X
rotated_pieces = 0
    
if Y%2 == 0:
    p_in_y = int(Y/2)
else:
    p_in_y = int(Y/2)
    rotated_pieces = int(X/2)

pieces = p_in_x*p_in_y + rotated_pieces
print(int(pieces))
"""

""" 
n,k = map(int,input().split())
scores = list(map(int,input().split()))
participants = 0

for idx,obj in enumerate(scores):
    if (scores[idx] >= scores[k-1]) and scores[idx] > 0:
        participants += 1
    else:
        break

print(participants)
"""

