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).
#include <bits/stdc++.h>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
 
void Solve(){
	int a,b,c,d;
    scanf("%d%d%d%d",&a,&b,&c,&d);
    if (a>b)cout<<"Misha"<<endl;
    else if (a<b)cout<<"Vasya"<<endl;
    else cout<<"Tie"<<endl;
    
}
int main(){
    //fastIO
	#ifndef ONLINE_JUDGE
    freopen("inputs.txt", "rt", stdin);
    freopen("outputs.txt", "wt", stdout);
	#endif
    Solve();
}