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).
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
from math import ceil,factorial,gcd,log2
from collections import Counter, defaultdict
import heapq
import bisect
import random

def minimum_cost_notification(n, p, residents_info):
    residents_info.sort(key=lambda x: (x[1], x[0]))
    possibleCost=[(p,n)]
    tot=0
    cnt=0
    while cnt<n:
        cost,rem = heapq.heappop(possibleCost)
        tot+=cost
        rem-=1
        heapq.heappush(possibleCost, (residents_info[cnt][1],residents_info[cnt][0]))
        cnt+=1
        if rem>0:
            heapq.heappush(possibleCost, (cost,rem))
    return tot

def get_term(x,a,d):
    return (x-a)//d+1

def get_2_count(m,n):
    return sum(get_term(m, i, i) for i in range(1,n+1))


def main():
    # for _ in range(int(input())):
    a, b, c, d = map(int, input().split())
    m_Score=max((3*a)/10,a-(a/250)*c)
    v_Score=max((3*b)/10,b-(b/250)*d)
    if m_Score>v_Score:
        print("Misha")
    if m_Score<v_Score:
        print("Vasya")
    else:
        print("Tie")



            



# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()