#include <bits/stdc++.h>
using namespace std;
long long gcd(long long u, long long v) { return (v != 0) ? gcd(v, u % v) : u; }
char a[1000006], b[1000006];
int main() {
  scanf("%s", a);
  scanf("%s", b);
  int len1 = strlen(a);
  int len2 = strlen(b);
  int start1 = 0, start2 = 0;
  while (start1 < len1 && a[start1] == '0') ++start1;
  while (start2 < len2 && b[start2] == '0') ++start2;
  int end1 = len1 - 1, end2 = len2 - 1;
  if (end1 - start1 > end2 - start2) {
    printf(">\n");
    return 0;
  } else if (end1 - start1 < end2 - start2) {
    printf("<\n");
    return 0;
  }
  while (end1 >= start1 && end2 >= start2) {
    int c1 = a[start1];
    int c2 = b[start2];
    if (c1 < c2) {
      printf("<\n");
      return 0;
    } else if (c1 > c2) {
      printf(">\n");
      return 0;
    }
    ++start1;
    ++start2;
  }
  printf("=\n");
  return 0;
}
