Problem:
 Score : 100 points    Problem Statement In programming, hexadecimal notation is often used.  In hexadecimal notation, besides the ten digits 0, 1, ..., 9 , the six letters A , B , C , D , E and F are used to represent the values 10, 11, 12, 13, 14 and 15 , respectively.  In this problem, you are given two letters X and Y . Each X and Y is A , B , C , D , E or F .  When X and Y are seen as hexadecimal numbers, which is larger?      Constraints  Each X and Y is A , B , C , D , E or F .         Input Input is given from Standard Input in the following format:  X  Y       Output If X is smaller, print < ; if Y is smaller, print > ; if they are equal, print = .        Sample Input 1 A B      Sample Output 1 <  10 < 11 .       Sample Input 2 E C      Sample Output 2 >  14 > 12 .       Sample Input 3 F F      Sample Output 3 =  15 = 15 .

Solution (Python):
x,y = input().split()

if x < y:
    print('<')
elif x == y:
    print('=')
else:
    print('>')

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b = rs()
if a<b:
  print('<')
elif a==b:
  print('=')
else:
  print('>')

Solution (Python):
x, y = map(ord ,input().split())
if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
x, y = M()
if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Solution (Python):
x, y = input().split()
alpha = ['A', 'B', 'C', 'D', 'E', 'F']

if x == y:
    print('=')
else:
    if alpha.index(x) < alpha.index(y):
        print('<')
    else:
        print('>')

Solution (Python):
a,b=map(ord,input().split())
if a>b:
    print(">")
elif a<b:
    print("<")
else:
    print("=")

Solution (Python):
A, B = map(lambda S: int(S,16), input().split())
if A < B:
  print("<")
elif A == B:
  print("=")
else:
  print(">")

Solution (Python):
x, y = map(str, input().split())
if x < y:
  print("<")
elif x > y:
  print(">")
else:
  print("=")

Solution (Python):
x,y = map(str,input().split())

if x == y:
  print("=")
elif x > y:
  print(">")
else:
  print("<")

Solution (Python):
a,b=input().split()
if a>b:
  print(">")
elif a<b:
  print("<")
else:
  print("=")

Solution (Python):










import sys

def input(): return sys.stdin.readline().rstrip()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]

def OutH(lst, deli=' '): print(deli.join(map(str, lst)))
def OutV(lst): print('\n'.join(map(str, lst)))

sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1

INF = int(1e9)
MOD = 1000000007
dx = (-1, 0, 1, 0)
dy = (0, -1, 0, 1)


S = sInLH()

if S[0] < S[1]:
  ans = '<'
elif S[0] > S[1]:
  ans = '>'
else:
  ans = '='
  
print(ans)

Solution (Python):
A, B = input().split()

if A < B:
    print("<")
elif A > B:
    print(">")
elif A == B:
    print("=")

Solution (Python):
a, b = input().split()
if a == b:
  print("=")
else:
  print(">" if a > b else "<")

Solution (Python):
a,b = map(str, input().split())
if a < b:
    print("<") 
elif a > b:
    print(">")
else:
    print("=")

Solution (Python):
x,y = map(str,input().split())
if x>y:
  print(">")
elif x<y:
  print("<")
else:
  print("=")

Solution (Python):
X,Y=input().split()

if X<Y:
	print("<")
elif X>Y:
	print(">")
else:
	print("=")

Solution (Python):
A,B = map(str,input().split())

def comp(A,B):
    if A > B:
        return '>'
    elif A<B:
        return '<'
    else:
        return '='

ans = comp(A,B)
print(ans)

Solution (Python):
x, y = input().split()
if x < y:
  print('<')
elif x > y:
  print('>')
else:
  print('=')

Solution (Python):
x, y = input().split()
if x < y:
    print("<")
elif x > y:
    print(">")
else:
    print("=")

Solution (Python):
A,B=list(input().split())
if A < B:
  print("<")
elif A == B:
  print("=")
else:
  print(">")

Solution (Python):
x,y=input().split()
if x<y:
  print("<")
elif x>y:
  print(">")
else:
  print("=")

Solution (Python):
import sys
X,Y = map(str,input().split())

list = ['A','B','C','D','E','F']
if X not in list or Y not in list:
    sys.exit()

if ord(X) < ord(Y):
    print("<")
if ord(X) == ord(Y):
    print("=")
if ord(X) > ord(Y):
    print(">")

Solution (Python):
x,y=input().split()
if x<y:
  print("<")
elif x>y:
  print(">")
else:
  print("=")

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

A,B = S()
if ord(A) > ord(B):
    print('>')
if ord(A) == ord(B):
    print('=')
if ord(A) < ord(B):
    print('<')

Solution (Python):
X,Y=map(str,input().split())
if X<Y:
  print('<')
elif X>Y:
  print('>')
else:
  print('=')

Solution (Python):
x, y = input().split()
print(["=", ">", "<"][x>y or -(x<y)])

Solution (Python):
x,_,y=input()
print('=><'[(x>y)-(x<y)])

Solution (Python):
x,y=input().split();print("<" if x<y else "=" if x==y else ">" )

Solution (Python):
X,Y=input().split()

if X<Y:
	print("<")
else:
	if X>Y:
		print(">")
	else:
		print("=")

Solution (Python):
X, Y = input().split()

if (Y == "F"):
    if (X == "F"):
        print("=")
    else:
        print("<")

elif(Y == "E"):
    if (X == "F"):
        print(">")
    elif (X == "E"):
        print("=")
    else:
        print("<")

elif(Y == "D"):
    if (X == "F"):
        print(">")
    elif (X == "E"):
        print(">")
    elif (X == "D"):
        print("=")
    else:
        print("<")

elif (Y == "C"):
    if (X == "F"):
        print(">")
    elif (X == "E"):
        print(">")
    elif (X == "D"):
        print(">")
    elif (X == "C"):
        print("=")
    else:
        print("<")

elif (Y == "B"):
    if (X == "F"):
        print(">")
    elif (X == "E"):
        print(">")
    elif (X == "D"):
        print(">")
    elif (X == "C"):
        print(">")
    elif (X == "B"):
        print("=")
    else:
        print("<")
    
elif (Y == "A"):
    if (X == "A"):
        print("=")
    else:
        print(">")

Solution (Python):
x, y = input().split()
if x < y:
  print('<')
elif x == y:
  print('=')
else:
  print('>')

Solution (Python):


x, y = map(str, input().split())

if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Solution (Python):
x, y = input().split()
st = ['A','B','C','D','E','F']
xin = st.index(x)
yin = st.index(y)
if xin > yin:
    print('>')
elif xin < yin:
    print('<')
else:
    print('=')

Solution (Python):
x,y = input().split()
if ord(x) == ord(y):
    print("=")
elif ord(x) > ord(y):
    print(">")
else:
    print("<")

Solution (Python):
a,b = map(ord,input().split())
print(">" if a>b else "=" if a == b else "<")

Solution (Python):
X, Y = input().split()
print("<" if X < Y else "=" if X == Y else ">")

Solution (Python):
x,y=input().split()
if x<y:
  print('<')
elif x>y:
  print('>')
else:
  print('=')

Solution (Python):
def main():
    a, b = input().split()
    alphabet = {'A': 10, 'B': 11, 'C': 12, 'D': 13, 'E': 14, 'F': 15}
    if alphabet.get(a) < alphabet.get(b):
        print('<')
    elif alphabet.get(a) > alphabet.get(b):
        print('>')
    else:
        print('=') 
main()

Solution (Python):
x,y=map(str,input().split())
if x>y:
    print(">")
if x<y:
    print("<")
if x==y:
    print("=")

Solution (Python):
X, Y = map(str, input().split())

if X < Y:
    print("<")
elif X == Y:
    print("=")
else:
    print(">")

Solution (Python):
x, y = input().split()
if x < y:
    print("<")
elif x > y:
    print(">")
else:
    print("=")

Solution (Python):
A,B,C,D,E,F = 10,11,12,13,14,15
x,y = map(str,input().split())
if x < y:
  print("<")
elif x > y:
  print(">")
else:
  print("=")

Solution (Python):
a, b = input().split()
if a > b: print('>')
elif a == b: print('=')
else: print('<')

Solution (Python):
x, y = input().split()
if x > y:
  print('>')
elif x == y:
  print('=')
else:
  print('<')

Solution (Python):
x, y = input().split()
if x > y:
  print('>')
elif x < y:
  print('<')
else:
  print('=')

Solution (Python):
x, y = input().split()
if x > y:
  print('>')
elif x < y:
  print('<')
else:
  print('=')

Solution (Python):
x,y=input().split()
if x>y:
  ans=">"
elif x==y:
  ans="="
else:
  ans="<"
  
print(ans)

Solution (Python):
X,Y = input().split()

arb = ['A','B','C','D','E','F']

print('=' if arb.index(X) == arb.index(Y) else '<'  
if arb.index(X) < arb.index(Y) else '>')

Solution (Python):
X,Y = input().split()

if X<Y:
  print("<")
elif X==Y:
  print("=")
else:
  print(">")

Solution (Python):
c,d=map(str,input().split())
n=sorted([c,d])
a=n.index(c)
b=n.index(d)
if a>b:
  print('>')
elif a==b:
  print('=')
else:
  print('<')

Solution (Python):
def actual(x, y):
    ord_x = ord(x)
    ord_y = ord(y)
    
    if ord_x < ord_y:
        return '<'

    if ord_x > ord_y:
        return '>'

    return '='

x, y = input().split()
print(actual(x, y))

Solution (Python):
x, y = map(str, input().split())
if x < y:
  print("<")
elif x == y:
  print("=")
else:
  print(">")

Solution (Python):
x, y = input().split()
ans = "="
if x < y:
    ans = "<"
elif x > y:
    ans = ">"
print(ans)

Solution (Python):
X, Y = map(str, input().split())
if X > Y: print(">")
elif X == Y: print("=")
else: print("<")

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    X, Y = input().split()

    if X < Y:
        ans = "<"
    elif X > Y:
        ans = ">"
    else:
        ans = "="

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):

L = ["A","B","C","D","E","F"]
P,Q = input().split()
p = L.index(P)
q = L.index(Q)
if p>q:
  print(">")
elif p<q:
  print("<")
else:
  print("=")

Solution (Python):
a,b=input().split();print('=' if a==b else '<' if a<b else '>')

Solution (Python):
lst=['A','B','C','D','E','F']
x,t=input().split()
if lst.index(x) > lst.index(t):
  print('>')
elif lst.index(x) < lst.index(t):
  print('<')
else:
  print('=')

Solution (Python):
x,y=input().split()
if ord(x)<ord(y):
  print('<')
elif ord(x)>ord(y):
  print('>')
else:
  print('=')

Solution (Python):
a,b = map(str,input().split())
if ord(a) == ord(b):
  print("=")
elif ord(a) > ord(b):
  print(">")
else:
  print("<")

Solution (Python):
x, y = input().split()
if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Solution (Python):
x, y = input().split()
if x < y: print("<")
elif x > y: print(">")
else: print("=")

Solution (Python):
x, y = input().split()

dict = { 'A':10 , 'B':11 , 'C':12 , 'D':13, 'E':14, 'F':15 }

if dict[x] > dict[y]:
  print('>')
elif dict[x] == dict[y]:
  print('=')
else:
  print('<')

Solution (Python):
X,Y=input().split()
if X<Y:
  print("<")
elif X>Y:
  print(">")
else:
  print("=")

Solution (Python):
a, b = input().split()
print(">" if a > b else "<" if a < b else "=")

Solution (Python):

import math

x,y=input().split()
if(ord(x)>ord(y)):
    print(">")
elif(ord(x)==ord(y)):
    print("=")
else:
    print("<")

Solution (Python):
x,y = map(str,input().split())
if x > y:
  print('>')
elif x < y:
  print('<')
else:
  print('=')

Solution (Python):



x, y = input().split()

a = int(x, 16)
b = int(y, 16)

if a > b:
    print(">")
elif a < b:
    print("<")
else:
    print("=")

Solution (Python):
X,Y=input().split()

if X<Y:
  print("<")
elif X==Y:
  print("=")
else:
  print(">")

Solution (Python):
x, y = input().split()

if ord(x) > ord(y):
    print(">")
elif ord(x) < ord(y):
    print("<")
else:
    print("=")

Solution (Python):
x, y = map(str, input().split())
A = 10
B = 11
C = 12
D = 13
E = 14
F = 15
if x < y:
    print("<")
elif x > y:
    print(">")
else:
    print("=")

Solution (Python):
x,y = input().split()

a = ord(x)
b = ord(y)
if a<b:
  print("<")
elif a>b:
  print(">")
else:
  print("=")

Solution (Python):
X, Y = input().split()
print("<" if X<Y else ">" if X>Y else "=")

Solution (Python):
a_list = ['A', 'B', 'C', 'D', 'E', 'F']
x, y = input().split()
if int(a_list.index(x)) > int(a_list.index(y)):
    print('>')
elif int(a_list.index(x)) < int(a_list.index(y)):
    print('<')
else:
    print('=')

Solution (Python):
x,y=map(str,input().split())
arr=['A','B','C','D','E','F']
if arr.index(x)<arr.index(y):
    print('<')
elif arr.index(x)>arr.index(y):
    print('>')
else:
    print('=')

Solution (Python):
x, y = list(map(str, input().split()))

if x < y:
    print("<")
elif x == y:
    print("=")
else:
    print(">")

Solution (Python):
X, Y = input().split()
print("<" if X < Y else "=" if X == Y else ">")

Solution (Python):
x, y = input().split()
if x < y:
    print('<')
elif x == y:
    print('=')
else:
    print('>')

Solution (Python):
a,b = input().split()
if a < b: print('<')
elif a > b: print('>')
else: print('=')

Solution (Python):
x,y=input().split()
print("<" if x<y else "=" if x==y else ">")

Solution (Python):
x, y = input().split()
if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Solution (Python):
x, y = map(str, input().split())
if ord(x) > ord(y): print('>')
elif ord(x) < ord(y): print('<')
else: print('=')

Solution (Python):
X, Y = input().split()
if X < Y:
  print('<')
elif X > Y:
  print('>')
else:
  print('=')

Solution (Python):
X,Y=map(str,input().split())
a=['A','B','C','D','E','F']
b=['10','11','12','13','14','15']

for i in range(6):
  if X==a[i]:
    X=b[i]
  if Y==a[i]:
    Y=b[i]
    
if X<Y:
  print('<')
elif X==Y:
  print('=')
else:
  print('>')

Solution (Python):
X,Y = map(str, input().split())
l = ['A','B','C','D','E','F']
if l.index(X)>l.index(Y):
  print('>')
elif l.index(X)<l.index(Y):
  print('<')
else:
  print('=')

Solution (Python):
X,Y = input().split()

x = "ABCDEF".index(X)
y = "ABCDEF".index(Y)

if x==y:
  print("=")
elif x>y:
  print(">")
else:
  print("<")

Solution (Python):
x,y=input().split()
if x>y:
    print('>')
elif x==y:
    print('=')
else:
    print('<')

Solution (Python):
a,b=input().split()
print(">") if a>b else print("<") if a<b else print("=")

Solution (Python):
X, Y = input().split()
if ord(X) > ord(Y):
    print('>')
elif ord(X) == ord(Y):
    print('=')
else:
    print('<')

Solution (Python):
A,B = input().split()
if A>B:
  print(">")
elif A==B:
  print("=")
else:
  print("<")

Solution (Python):
X, Y = input().split()
if X == Y:
    print("=")
elif X > Y:
    print(">")
else:
    print("<")

Solution (Python):
x,y = input().split()
li = ['A','B','C','D','E','F']
x = li.index(x)
y = li.index(y)
if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Solution (Python):
a,b = input().split()

def xy(a):
    if a =="A":
        return 10
    elif a =="B":
        return 11
    elif a =="C":
        return 12
    elif a =="D":
        return 13
    elif a =="E":
        return 14
    elif a =="F":
        return 15
    
if xy(a) > xy(b):
    print(">")
elif xy(a) < xy(b):
    print("<")
else:
    print("=")

Solution (Python):
x, y = map(str, input().split())
print("<" if x < y else ">" if x > y else "=")

Solution (Python):
a, b= map(str, input().split())
if a == b:
  print('=')
else:
  a = int(a, 16)
  b = int(b, 16)
  if a > b:
    print('>')
  else:
    print('<')

Solution (Python):
x,y=input().split()
sixt={'A':10,'B':11,'C':12,'D':13,'E':14,'F':15}
if sixt[x]>sixt[y]:
    print('>')
elif sixt[x]<sixt[y]:
    print('<')
else:
    print('=')

Solution (Python):
x, y = map(str, input().split())
li=[x, y]
li1 = [x, y]
li.sort()
if x==y:
  print('=')
elif li==li1:
  print('<')
else:
  print('>')

Solution (Python):
x,y=input().split()
if ord(x) < ord(y):
  print("<")
elif x==y:
  print("=")
else:
  print(">")

Solution (Python):
x, y = input().split()
print("<" if x < y else (">" if x > y else "="))

Solution (Python):
x,y=input().split()
if x>y:
    print(">")
elif x<y:
    print("<")
else:
    print("=")

Solution (Python):
lst=["A","B","C","D","E","F"]
a=input()
if lst.index(a[0])>lst.index(a[2]):
    print(">")
elif lst.index(a[0])==lst.index(a[2]):
    print("=")
else:
    print("<")

Solution (Python):
X,Y = input().split()

if X > Y:
  print('>')
elif X < Y:
  print('<')
else:
  print('=')

Solution (Python):
x,y = map(str,input().split())
print(">") if ord(x)>ord(y) else print("<") if ord(x)<ord(y) else print("=")

Solution (Python):
x,y=input().split();print("="if x==y else">"if x>y else"<")

Solution (Python):

x,y=map(str,input().split())

l=list('ABCDEF')

xi=l.index(x)
yi=l.index(y)

if (xi<yi):print('<')
elif (xi>yi):print('>')
else:print('=')

Solution (Python):
X, Y = list(map(str, input().split()))

if ord(X) > ord(Y):
  print(">")
elif ord(X) < ord(Y):
  print("<")
else:
  print("=")

Solution (Python):
x, y = input().split()
print('>' if x > y else '=' if x == y else '<')

Solution (Python):
xy = input()
x, y = xy[0], xy[2]

if x < y:
    print("<")
elif x == y:
    print("=")
else:
    print(">")

Solution (Python):
X,Y=input().split()
if X<Y:
    print('<')
elif X==Y:
    print('=')
else:
    print('>')

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

def main():
    x,y = input().split()

    if x == y:
        print('=')
    elif x < y:
        print('<')
    else:
        print('>')


if __name__ == '__main__':
    main()

Solution (Python):
X, Y = input().split()
x = ord(X); y = ord(Y)

if x < y:
  print('<')
elif x == y:
  print('=')
else:
  print('>')

Solution (Python):
x,y=map(str,input().split())
a=['A','B','C','D','E','F']
x=a.index(x)
y=a.index(y)
if x>y:
    print('>')
elif x<y:
    print('<')
else:
    print('=')

Solution (Python):
x,y=input().split()
print('<' if x<y else '>' if x>y else '=')

Solution (Python):
x,y=input().split()
if ord(x)>ord(y):
  print('>')
elif ord(x)==ord(y):
  print('=')
else:
  print('<')

Solution (Python):
z = input().split()
l = {
  'A': 1
  , 'B': 2
  , 'C': 3
  , 'D': 4
  , 'E': 5
  , 'F': 6
}
x = l[z[0]]
y = l[z[1]]
if x > y:
  print('>')
elif x < y:
  print('<')
else:
  print('=')

Solution (Python):
X,Y = input().split()
print("<" if X < Y else ">" if X>Y else "=")

Solution (Python):
x, y = map(str, input().split())
s = ['A', 'B', 'C', 'D', 'E', 'F']
for i in range(6):
    if x == s[i]:
        xi = i
    if y == s[i]:
        yi = i
if xi > yi:
    print('>')
elif xi < yi:
    print('<')
else:
    print('=')

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

x, y = readline().decode().split()


if x < y:
    print('<')
elif x == y:
    print('=')
else:
    print('>')

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

x, y = readline().decode().split()
x = int(x.lower(), 16)
y = int(y.lower(), 16)
if x < y:
    print('<')
elif x == y:
    print('=')
else:
    print('>')

Solution (Python):
x, y = map(str, input().split())
print("<" if x < y else "=" if x == y else ">")

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b = input().split()
    if a < b:
        print('<')
    elif a == b:
        print('=')
    else:
        print('>')


if __name__ == "__main__":
    main()

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

X, Y = input().split()

if X == Y:
    print('=')
elif X < Y:
    print("<")
else:
    print(">")

Solution (Python):
x, y = input().split()
if ord(x) == ord(y):
    print("=")
elif ord(x) > ord(y):
    print(">")
else:
    print("<")

Solution (Python):
X, Y = map(str, input().split())
lst = ["A","B","C","D","E","F"]
x = lst.index(X)
y = lst.index(Y)

if x < y:
    print("<")
elif x > y:
    print(">")
else:
    print("=")

Solution (Python):
a,b = input().split()
if ord(a) > ord(b):
  print(">")
elif ord(a) == ord(b):
  print("=")
else:
  print("<")

Solution (Python):
x,y=input().split()
print("<"if x<y else ">" if x>y else"=")

Solution (Python):
X,Y = map(str,input().split())

a = ['A','B','C','D','E','F']
b = [10,11,12,13,14,15]

if a.index(X) > a.index(Y):
    print('>')
elif X == Y:
    print('=')
else:
    print('<')

Solution (Python):
x, y = input().split()
if x < y:
    print('<')
elif x == y:
    print('=')
else:
    print('>')

Solution (Python):
x,y=input().split()
if int(x,16)>int(y,16):
  print(">")
elif int(x,16)<int(y,16):
  print("<") 
else:
  print("=")

Solution (Python):
x, y = input().split()

if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Solution (Python):
X,Y= input().split()
if X>Y:
    print(">")
elif X==Y:
    print("=")
else:
    print("<")

Solution (Python):
import sys
s = list(input().split())
if s[0] == s[1]:
    print("=")
    sys.exit()
r = sorted(s)
if s == r:
    print("<")
else:
    print(">")

Solution (Python):
x, y = input().split()
if x < y:
  print('<')
elif x == y:
  print('=')
else:
  print('>')

Solution (Python):
x, y = input().split()
print('<' if x < y else '>' if x > y else '=')

Solution (Python):
a, b = input().split()
if a < b:
    print('<')
elif a > b:
    print('>')
else:
    print('=')

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    X,Y=input().split()
    if ord(X)<ord(Y):
        print('<')
    elif ord(X)==ord(Y):
        print('=')
    else:
        print('>')

if __name__ == '__main__':
    main()

Solution (Python):

X, Y = map(str, input().split())

print('<' if X < Y else '>' if X > Y else '=')

Solution (Python):
x,y=input().split()
X=int(x,16)
Y=int(y,16)
if X<Y:
  print("<")
elif X==Y:
  print("=")
else:
  print(">")

Solution (Python):
A, B = input().split()

if ord(A) < ord(B):
    print("<")
elif ord(A) == ord(B):
    print("=")
else:
    print(">")

Solution (Python):
x, y = map(str, input().split())

if x < y:
    print('<')
elif x > y:
    print('>')
else:
    print('=')

Solution (Python):
X,Y = input().split()

if ord(X) < ord(Y):
    print('<')
elif ord(X) == ord(Y):
    print('=')
else:
    print('>')

Solution (Python):
a, b = input().split()
if a < b:
    print('<')
elif a > b:
    print('>')
else:
    print('=')

Solution (Python):
X,Y=input().split()
XY=[X,Y]
XY.sort()
if X==Y:
    print("=")
elif X==XY[0]:
    print("<")
else:
    print(">")

Solution (Python):
x, y = input().split()
if x < y:
    print('<')
elif x == y:
    print('=')
else:
    print('>')

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





X,Y = inputSL()

if ord(X) == ord(Y):
  print("=")
elif ord(X) > ord(Y):
  print(">")
else:
  print("<")

Solution (Python):
x,y=map(str,input().split())
if x<y:
  print("<")
elif x>y:
  print(">")
else:
  print("=")

Solution (Python):
X,Y=input().split()
if (X<Y):
    print("<")
elif (X==Y):
    print("=")
elif (X>Y):
    print (">")

Solution (Python):
x,y=input().split()
if x<y:
    print("<")
elif x==y:
    print("=")
else:
    print(">")

Solution (Python):
X, Y = input().split()
print("<" if X<Y else "=" if X==Y else ">")

Solution (Python):
import sys
import math
import bisect

def main():
    x, y = input().split()
    if ord(x) < ord(y):
        print('<')
    elif ord(x) > ord(y):
        print('>')
    else:
        print('=')
    
if __name__ == "__main__":
    main()

Solution (Python):
x,y=input().split()
print("<"if x<y else ">"if y<x else "=")

Solution (Python):
X,Y=map(str,input().split())
if X==Y:
    print('=')
elif X>Y:
    print('>')
else:
    print('<')

Solution (Python):
x, y = input().split()
shinsu = {
    'A':1,
    'B':2,
    'C':3,
    'D':4,
    'E':5,
    'F':6
}

if shinsu[x] < shinsu[y]:
    print('<')
elif shinsu[x] > shinsu[y]:
    print('>')
else:
    print('=')

Solution (Python):
X,Y = input().split()
print(">" if X > Y else "=" if X == Y else "<")

Solution (Python):
S = list(map(str, input().split()))
if S[0] == S[1]:
    print("=")
    exit()
if S == sorted(S):
    print("<")
else:
    print(">")

Solution (Python):
A = list(input().split())
if A[0] == A[1]:
    print("=")
elif min(A[0],A[1]) == A[1]:
    print(">")
else:
    print("<")

Solution (Python):
X, Y = input().split()
print('<' if Y>X else '>' if X>Y else '=')

Solution (Python):
X, Y = input().split()
print("<" if X < Y else ">" if X > Y else "=")

Solution (Python):
x, y = input().split()
if x > y:
    print('>')
elif x < y:
    print('<')
else:
    print('=')

Solution (Python):
a,b = (str(x) for x in input().split())
if a < b:
    print("<")
elif a > b:
    print(">")
else:
    print("=")

Solution (Python):
h=list('ABCDEF')
X,Y=input().split()
if X==Y: print('=')
else: print('<' if h.index(X)<h.index(Y) else '>')

Solution (Python):
X, Y = input().split()

if X > Y:
    print(">")
elif X < Y:
    print("<")
else:
    print("=")

Solution (Python):
def ABC_78_A():
    X,Y = map(str, input().split())
    list1 = ['A','B','C','D','E','F']
    list2 = [10,11,12,13,14,15]
    
    if list2[list1.index(X)] > list2[list1.index(Y)]:
        print('>')
    elif list2[list1.index(X)] < list2[list1.index(Y)]:
        print('<')
    else:
        print('=')



if __name__ == '__main__':

    ABC_78_A()

Solution (Python):
x,y = map(str,input().split())
print("<" if x<y else ">" if x>y else "=")

Solution (Python):
N16 = {'A':1,'B':2,'C':3,'D':4,'E':5,'F':6,}
X,Y = input().split()
if N16[X] == N16[Y]:
    print('=')
elif N16[X] > N16[Y]:
    print('>')
else:
    print('<')

Solution (Python):
X, Y = input().split()
if X > Y:
    print('>')
elif X < Y:
    print('<')
else:
    print('=')

Solution (Python):
def resolve():
	x, y = input().split()
	if ord(x) > ord(y):
		print('>')
	elif ord(x) == ord(y):
		print('=')
	else:
		print('<')
resolve()

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

X, Y = rs_()
print('=' if X == Y else '<' if X < Y else '>')

Solution (Python):
def main():
    x,y = (input().split())
    if x == y: print('=')
    elif x < y: print('<')
    else: print('>')

if __name__ == '__main__':
    main()

Solution (Python):
X,Y = map(str,input().split())
if ord(X) < ord(Y):
    print('<')
elif ord(X) == ord(Y):
    print('=')
else:
    print('>')

Solution (Python):
x,y=map(str,input().split())

if ord(x) < ord(y):
    print("<")
elif ord(x) == ord(y):
    print("=")
else:
    print(">")

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b=input().split()
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')
resolve()

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b=input().split()
    a=ord(a)
    b=ord(b)
    if a<b:
        print('<')
    elif a>b:
        print('>')
    else:
        print('=')
resolve()

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    L=[0,1,2,3,4,5,6,7,8,9,'A', 'B', 'C','D','E','F']

    x,y=map(str,input().split())
    if L.index(x)==L.index(y):
        print('=')
    elif L.index(x)>L.index(y):
        print('>')
    else:
        print('<')

    
resolve()