#include <bits/stdc++.h>
using namespace std;
const int N = 9999999;
bool prime[N + 1];
void SieveOfEratosthenes() {
  memset(prime, true, sizeof(prime));
  for (int p = 2; p * p <= N; p++) {
    if (prime[p] == true) {
      for (int i = p * 2; i <= N; i += p) prime[i] = false;
      prime[p] = false;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int x, y;
  cin >> x >> y;
  if (x == 1 && y != 1) {
    cout << "<";
    return 0;
  }
  if (y == 1 && x != 1) {
    cout << ">";
    return 0;
  }
  if (x == y) {
    cout << "=";
    return 0;
  }
  if (x > 2 && y > 2) {
    if (x > y) cout << "<";
    if (y > x) cout << ">";
    return 0;
  }
  if (x == 2 && (y > 2 && y > 2)) {
    if (y == 3)
      cout << "<";
    else if (y == 4)
      cout << "=";
    else
      cout << ">";
  }
  if (x > 2 && y == 2) {
    if (x == 3)
      cout << ">";
    else if (x == 4)
      cout << "=";
    else
      cout << "<";
  }
  return 0;
}
