#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

using mint = atcoder::modint998244353;

void solve() {
	ll n1, d1, n2, d2;
	cin >> n1 >> d1 >> n2 >> d2;
	ll p = n1 * d2, q = n2 * d1;
	if (p < q) cout << "<\n";
	else if (p > q) cout << ">\n";
	else cout << "=\n";
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}