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
from collections import Counter, defaultdict, deque
from heapq import heapify, heappush, heappop
from functools import lru_cache
from math import floor, ceil, sqrt, gcd
from string import ascii_lowercase
from math import gcd
from bisect import bisect_left, bisect, bisect_right


def read():
    return input().strip()


def read_int():
    return int(read())


def read_str_list():
    return read().split()


def read_numeric_list():
    return list(map(int, read_str_list()))


def points(p, t):
    return max(3*p/10, p - p/250*t)


def solve(a, b, c, d):
    m = points(a, c)
    v = points(b, d)

    if m == v:
        return "Tie"
    elif m < v:
        return "Vasya"
    else:
        return "Misha"


a, b, c, d = read_numeric_list()

print(solve(a, b, c, d))
