#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  ll a, b, c, d;
  cin >> a >> b >> c >> d;
  auto ans = a * d <=> b * c;
  if (ans == strong_ordering::less) {
    cout << '<' << '\n';
  }
  if (ans == strong_ordering::equal) {
    cout << '=' << '\n';
  }
  if (ans == strong_ordering::greater) {
    cout << '>' << '\n';
  }
  return 0;
}