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 math 

def primeFactors(n):
    l = []
    c = 2
    while(n > 1):
        if(n % c == 0):
            l.append(c)
            n = n / c
        else:
            c = c + 1
    return l
def primeFactors(n):
    l = []
    c = 2
    while(n > 1):
        if(n % c == 0):
            l.append(c)
            n = n / c
        else:
            c = c + 1
    return l
 
'''-----------------------------------------------------------------------'''
def prime(n):
    prime_flag = 0
    if(n > 1):
        for i in range(2, int(math.sqrt(n)) + 1):
            if (n % i == 0):
                prime_flag = 1
                break
    return prime_flag
'''---------------------------------------------------------------------'''
def min_factor(n):
    mini = 100000000
    i = 2
    while(i*i<=n):
        if n%i==0:
            mini= min(mini,i)
        i+=1
    
    mini = min(mini,n)
    return mini

l = list(map(int,input().split()))
a = l[0]
b = l[1]
c = l[2]
d = l[3]
m = max((3*a)//10,a-((a/250)*c))
v = max((3*b)//10,b-((b/250)*d))
if m>v:
    print("Misha")
elif m<v:
    print("Vasya")
else:
    print("Tie")