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 sys
#import itertools
#import math

#t = int(input())
t = 1

while t > 0:
    #print(t)

    a,b,c,d = [int(x) for x in input().split()]
    m = max(3*a/10, a-a/250*c)
    v = max(3*b/10, b-b/250*d)
    if m>v:
        print("Misha")
    elif v>m: print("Vasya")
    else: print("Tie")

    t -= 1

'''def strictly_increasing(L):
    return all(x<y for x, y in zip(L, L[1:]))

def strictly_decreasing(L):
    return all(x>y for x, y in zip(L, L[1:]))

def non_increasing(L):
    return all(x>=y for x, y in zip(L, L[1:]))

def non_decreasing(L):
    return all(x<=y for x, y in zip(L, L[1:]))

def monotonic(L):
    return non_increasing(L) or non_decreasing(L)
'''
#indices = [i for i, x in enumerate(my_list) if x == "whatever"]
#itertools.permutations(iterable) 
#itertools.combinations(iterable, r) 