#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T abs(T x) {
  return x < 0 ? -x : x;
}
template <typename T>
inline T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
long long power(long long x, long long n) {
  long long result = 1;
  while (n) {
    if (n & 1) result = result * x % 1000000007;
    n = n / 2;
    x = x * x % 1000000007;
  }
  return result;
}
void solve() {
  string a, b;
  int i = 0, j = 0;
  cin >> a >> b;
  for (; i < a.length() && a[i] == 48; ++i) {
  }
  for (; j < b.length() && b[j] == 48; ++j) {
  }
  if (a.length() - i > b.length() - j)
    cout << ">";
  else if (a.length() - i < b.length() - j)
    cout << "<";
  else {
    int t = (a.substr(i, a.length())).compare(b.substr(j, b.length()));
    if (t == 0)
      cout << "=";
    else if (t > 0)
      cout << ">";
    else
      cout << "<";
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t = 1;
  while (t--) solve();
  return 0;
}
