#include <bits/stdc++.h>
int dx[] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy[] = {-1, 0, 1, 1, 1, 0, -1, -1};
using namespace std;
long long power(long long a, long long p, long long M) {
  long long r = 1;
  a = a % M;
  while (p > 0) {
    if (p % 2) r = (r * a) % M;
    a = (a * a) % M;
    p /= 2;
  }
  return r % M;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long multiply(long long a, long long b, long long m) {
  return ((a % m) * (b % m)) % m;
}
void solve() {
  long long n = 2;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  long long x = a[0], y = a[1];
  sort(a, a + n);
  if (x == y) {
    cout << "=";
    return;
  }
  if (a[0] >= 4) {
    if (x > y)
      cout << "<";
    else
      cout << ">";
    return;
  }
  if (a[0] == 1) {
    if (x == 1)
      cout << "<";
    else
      cout << ">";
    return;
  }
  if (a[0] == 2) {
    if (x == 2) {
      if (y == 3) {
        cout << "<";
      } else if (y == 4)
        cout << "=";
      else
        cout << ">";
    } else {
      if (x == 3) {
        cout << ">";
      } else if (x == 4)
        cout << "=";
      else
        cout << "<";
    }
    return;
  }
  if (a[0] == 3) {
    if (a[1] == 4) {
      if (x == 3)
        cout << ">";
      else
        cout << "<";
    } else {
      if (x == 3)
        cout << ">";
      else
        cout << "<";
    }
    return;
  }
}
int main() {
  solve();
  return 0;
}
