F Fraction Comparision
据说能处理数字长度38位以内的
#include<iostream>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<sstream>
#include<string.h>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
#define ll long long
#define lowbit(x) (x)&(-x)
#define mem(a,b) memset((a),(b),sizeof(a));
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
const ll inf=0x3f3f3f3f;//1061109567,2*未超int,allinf=mem(a,0x3f,sizeof(a));
typedef pair<int ,int > PII;
const int nn=1e6+10;
int st[100],n,f[100];
inline void read(__int128 &x){
int f=1;
x=0;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch<'0'&&ch>'9'){
x=x*10+ch-'0';
ch=getchar();
}
x*=f;
}
inline void outpt(__int128 x){
if(x<0){
putchar('-');
x=-x;
}
if(x>9)
outpt(x/10);
putchar(x%10+'0');
}
int main()
{
//#define io
#ifdef io
freopen("in.txt","r",stdin);
#endif
ll x,y,a,b,c;
while(cin>>x>>a>>y>>b){
__int128 xx,yy;
xx=(__int128)x*(__int128)b;
yy=(__int128)y*(__int128)a;
if(xx>yy)cout<<">"<<endl;
else if(xx==yy)cout<<"="<<endl;
else cout<<"<"<<endl;
}
return 0;
}