You are given two very long integers a, b (leading zeroes are allowed). You should check what number a or b is greater or determine that they are equal.

The input size is very large so don't use the reading of symbols one by one. Instead of that use the reading of a whole line or token.

As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java. Don't use the function input() in Python2 instead of it use the function raw_input().


-----Input-----

The first line contains a non-negative integer a.

The second line contains a non-negative integer b.

The numbers a, b may contain leading zeroes. Each of them contains no more than 10^6 digits.


-----Output-----

Print the symbol "<" if a < b and the symbol ">" if a > b. If the numbers are equal print the symbol "=".


-----Examples-----
Input
9
10

Output
<

Input
11
10

Output
>

Input
00012345
12345

Output
=

Input
0123
9

Output
>

Input
0123
111

Output
>

Source: codeforces | Difficulty: EASY
Tags: String algorithms

Implementation


Solutions:
num1 = input()
num2 = input()

def determine_smaller(num1, num2):
	for (n1, n2) in zip(num1, num2):
		if int(n1) < int(n2):
			print('<')
			return
		elif int(n2) < int(n1):
			print('>')
			return
	print('=')
if num1.startswith('0'):
	num1 = num1.lstrip('0')
if num2.startswith('0'):
	num2 = num2.lstrip('0')
if len(num1) > len(num2):
	print('>')
elif len(num2) > len(num1):
	print('<')
else:
	determine_smaller(num1, num2)


a = input().lstrip('0')
b = input().lstrip('0')
if len(a) < len(b):
	print('<')
elif len(a) > len(b):
	print('>')
else:
	for i in range(len(a)):
		if a[i] < b[i]:
			print('<')
			exit()
		elif a[i] > b[i]:
			print('>')
			exit()
	print('=')


import sys, io, atexit
input = sys.stdin.buffer.readline
sys.stdout = io.StringIO()
atexit.register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
inst = lambda : input().decode().rstrip('\n\r')
inin = lambda : int(input())
inar = lambda : list(map(int, input().split()))
a = inst().lstrip('0')
b = inst().lstrip('0')
if len(a) < len(b):
	print('<')
elif len(a) > len(b):
	print('>')
elif a < b:
	print('<')
elif a > b:
	print('>')
else:
	print('=')


def main():
	a = input().lstrip('0')
	b = input().lstrip('0')
	if len(a) < len(b):
		print('<')
	elif len(a) > len(b):
		print('>')
	else:
		for (i, j) in zip(a, b):
			if i < j:
				print('<')
				return
			elif i > j:
				print('>')
				return
		print('=')
main()


a = str(input())
b = str(input())
a = a.lstrip('0')
b = b.lstrip('0')
flag = True
if len(a) > len(b):
	print('>')
	flag = False
elif len(a) < len(b):
	print('<')
	flag = False
if flag:
	flag1 = True
	for i in range(len(a)):
		if int(a[i]) > int(b[i]):
			print('>')
			flag1 = False
			break
		if int(a[i]) < int(b[i]):
			print('<')
			flag1 = False
			break
	if flag1:
		print('=')


s = input().strip().lstrip('0')
t = input().strip().lstrip('0')
if s == t:
	print('=')
elif len(s) > len(t):
	print('>')
elif len(s) < len(t):
	print('<')
elif s > t:
	print('>')
else:
	print('<')


a = input()
b = input()
if len(b) > len(a):
	a = '0' * (len(b) - len(a)) + a
elif len(b) < len(a):
	b = '0' * (len(a) - len(b)) + b
if a > b:
	print('>')
elif a < b:
	print('<')
else:
	print('=')


def calc(a, b, l):
	for i in range(l):
		if int(a[i]) > int(b[i]):
			return '>'
		elif int(a[i]) < int(b[i]):
			return '<'
	return '='
a = input()
b = input()
al = len(a)
bl = len(b)
if bl > al:
	a = '0' * (bl - al) + a
	al = bl
elif al > bl:
	b = '0' * (al - bl) + b
	bl = al
print(calc(a, b, bl))


import sys
from io import StringIO as stream
sys.stdin = stream(sys.stdin.read())
input = lambda : sys.stdin.readline().rstrip('\r\n')
inst = lambda : input().rstrip('\n\r')
inin = lambda : int(input())
inar = lambda : list(map(int, input().split()))
a = inst().lstrip('0')
b = inst().lstrip('0')
if len(a) < len(b):
	print('<')
elif len(a) > len(b):
	print('>')
elif a < b:
	print('<')
elif a > b:
	print('>')
else:
	print('=')


s = (input() + 'a').strip('0')
t = (input() + 'a').strip('0')
if len(s) == len(t):
	if s == t:
		print('=')
	else:
		print('> <'.split()[s < t])
elif len(s) > len(t):
	print('>')
else:
	print('<')


s1 = input()
s2 = input()
s1_len = len(s1)
s2_len = len(s2)
for i in range(s1_len):
	if s1[i] != '0':
		break
s1 = s1[i:]
s1_len -= i
for i in range(s2_len):
	if s2[i] != '0':
		break
s2 = s2[i:]
s2_len -= i
if s1_len > s2_len:
	print('>')
elif s2_len > s1_len:
	print('<')
else:
	for i in range(s1_len):
		if s1[i] != s2[i]:
			break
	if i == s1_len - 1 and s1[i] == s2[i]:
		print('=')
	elif int(s1[i]) > int(s2[i]):
		print('>')
	else:
		print('<')


A = input()
B = input()
inA = 0
inB = 0
f = 0
while inA < len(A) and A[inA] == '0':
	inA += 1
while inB < len(B) and B[inB] == '0':
	inB += 1
if len(A) - inA > len(B) - inB:
	print('>')
elif len(B) - inB > len(A) - inA:
	print('<')
else:
	while inA < len(A):
		if A[inA] > B[inB]:
			print('>')
			f = 1
			break
		elif A[inA] < B[inB]:
			print('<')
			f = 1
			break
		inA += 1
		inB += 1
	if f == 0:
		print('=')


a = input()
b = input()
if len(a) > len(b):
	gap = len(a) - len(b)
	new = ''
	for _ in range(gap):
		new += '0'
	b = new + b
elif len(b) > len(a):
	gap = len(b) - len(a)
	new = ''
	for _ in range(gap):
		new += '0'
	a = new + a
for i in range(0, len(a)):
	if a[i] > b[i]:
		print('>')
		exit()
	elif b[i] > a[i]:
		print('<')
		exit()
print('=')


a = input()
b = input()
a = a.lstrip('0')
b = b.lstrip('0')
l = max(len(a), len(b))
a = a.rjust(l, '0')
b = b.rjust(l, '0')
if a == b:
	print('=')
elif a > b:
	print('>')
else:
	print('<')


a = input()
b = input()
if len(a) > len(b):
	b = '0' * (len(a) - len(b)) + b
else:
	a = '0' * (len(b) - len(a)) + a
for i in range(0, len(a)):
	if a[i] > b[i]:
		print('>')
		return
	elif b[i] > a[i]:
		print('<')
		return
print('=')


import sys
inst = lambda : sys.stdin.buffer.readline().decode().rstrip('\n\r')
inin = lambda : int(sys.stdin.buffer.readline())
inar = lambda : list(map(int, sys.stdin.buffer.readline().split()))
a = '0' + inst()
b = '0' + inst()
na = ''
nb = ''
flag = False
for i in a:
	if flag:
		na += i
	elif i != '0':
		flag = True
		na += i
flag = False
for i in b:
	if flag:
		nb += i
	elif i != '0':
		flag = True
		nb += i
if len(na) < len(nb):
	print('<')
elif len(na) > len(nb):
	print('>')
else:
	ans = '='
	for i in range(len(na)):
		if int(na[i]) < int(nb[i]):
			ans = '<'
			break
		elif int(na[i]) > int(nb[i]):
			ans = '>'
			break
		else:
			pass
	print(ans)


(a, b) = (input(), input())
(La, Lb) = (len(a), len(b))
if La > Lb:
	b = '0' * (La - Lb) + b
if Lb > La:
	a = '0' * (Lb - La) + a
d = '='
for (i, j) in zip(a, b):
	if i != j:
		if int(i) > int(j):
			d = '>'
		else:
			d = '<'
		break
print(d)


a = input().rjust(10 ** 6, '0')
b = input().rjust(10 ** 6, '0')
if a > b:
	print('>')
elif a < b:
	print('<')
else:
	print('=')


(a, b) = [input().rjust(10 ** 6, '0') for i in range(2)]
if a < b:
	print('<')
elif a > b:
	print('>')
else:
	print('=')


N1 = input()
N2 = input()
count = int(0)
ZeroCount1 = int(0)
ZeroCount2 = int(0)
if N1[0] != '-' and N2[0] == '-':
	print('>')
elif N1[0] == '-' and N2[0] != '-':
	print('<')
else:
	for i in range(len(N1)):
		if N1[i] == '0' or (i + 1 < len(N1) and N1[i + 1] == '0' and (N1[0] == '-')):
			ZeroCount1 += 1
		else:
			break
	for i in range(len(N2)):
		if N2[i] == '0' or (i + 1 < len(N2) and N2[i + 1] == '0' and (N2[0] == '-')):
			ZeroCount2 += 1
		else:
			break
	if ZeroCount1 > 0:
		if N1[0] != '-':
			N1 = N1.replace(N1[:ZeroCount1], '', ZeroCount1)
		else:
			N1 = N1.replace(N1[:ZeroCount1], '-', ZeroCount1)
	if ZeroCount2 > 0:
		if N2[0] != '-':
			N2 = N2.replace(N2[:ZeroCount2], '', ZeroCount2)
		else:
			N2 = N2.replace(N2[:ZeroCount2], '-', ZeroCount2)
	if int(len(N1)) > int(len(N2)):
		print('>')
	elif int(len(N1)) < int(len(N2)):
		print('<')
	else:
		for i in range(int(len(N1))):
			if N1[i] is N2[i]:
				count += 1
				continue
			elif N1[i] > N2[i]:
				if N1[0] != '-':
					print('>')
					break
				else:
					print('<')
					break
			elif N1[0] != '-':
				print('<')
				break
			else:
				print('>')
				break
		if count == int(len(N1)):
			print('=')


s = input().rjust(10 ** 6, '0')
s1 = input().rjust(10 ** 6, '0')
print('>' if s > s1 else '<' if s1 > s else '=')


num1 = input()
num2 = input()
num1_stripped = num1.lstrip('0')
num2_stripped = num2.lstrip('0')
if len(num1_stripped) < len(num2_stripped):
	print('<')
elif len(num1_stripped) > len(num2_stripped):
	print('>')
else:
	for i in range(len(num1_stripped)):
		if int(num1_stripped[i]) < int(num2_stripped[i]):
			print('<')
			exit()
		elif int(num1_stripped[i]) > int(num2_stripped[i]):
			print('>')
			exit()
	print('=')


a = input().lstrip('0')
b = input().lstrip('0')
if a == '':
	a = '0'
if b == '':
	b = '0'
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	equal = True
	for i in range(0, len(a)):
		if int(a[i]) > int(b[i]):
			equal = False
			print('>')
			break
		elif int(a[i]) < int(b[i]):
			equal = False
			print('<')
			break
	if equal:
		print('=')


a = input().lstrip('0')
b = input().lstrip('0')
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	for i in range(len(a)):
		if int(a[i]) > int(b[i]):
			print('>')
			break
		elif int(a[i]) < int(b[i]):
			print('<')
			break
	else:
		print('=')


(a, b) = (input().lstrip('0'), input().lstrip('0'))
if len(a) > len(b):
	print('>')
elif len(a) != len(b):
	print('<')
else:
	i = 0
	while 1:
		try:
			if a[i] == b[i]:
				i += 1
			else:
				break
		except IndexError:
			break
	if i == len(a):
		print('=')
	elif a[i] > b[i]:
		print('>')
	else:
		print('<')


import sys
from bisect import bisect_right as rb
from collections import deque
from queue import PriorityQueue
from math import *
input_ = lambda : sys.stdin.readline().strip('\r\n')
ii = lambda : int(input_())
il = lambda : list(map(int, input_().split()))
ilf = lambda : list(map(float, input_().split()))
ip = lambda : input_()
fi = lambda : float(input_())
ap = lambda ab, bc, cd: ab[bc].append(cd)
li = lambda : list(input_())
pr = lambda x: print(x)
prinT = lambda x: print(x)
f = lambda : sys.stdout.flush()
mod = 10 ** 9 + 7
a = input().lstrip('0')
b = input().lstrip('0')
if len(a) < len(b):
	print('<')
elif len(a) > len(b):
	print('>')
elif a < b:
	print('<')
elif a > b:
	print('>')
else:
	print('=')


aa = input()
bb = input()
cta = 0
ctb = 0
start = False
for let in aa:
	if let == '0':
		cta += 1
	if let != '0':
		break
for let in bb:
	if let == '0':
		ctb += 1
	if let != '0':
		break
start = False
a = aa[cta:]
b = bb[ctb:]
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
elif a == b:
	print('=')
elif a > b:
	print('>')
else:
	print('<')


import sys
input = sys.stdin.buffer.readline
print = lambda _, end='\n': sys.stdout.write(str(_) + end)
inst = lambda : input().decode().rstrip('\n\r')
inin = lambda : int(input())
inar = lambda : list(map(int, input().split()))
a = inst().lstrip('0')
b = inst().lstrip('0')
if len(a) < len(b):
	print('<')
elif len(a) > len(b):
	print('>')
elif a < b:
	print('<')
elif a > b:
	print('>')
else:
	print('=')


def reduc(s):
	flag = True
	i = 0
	while i < len(s):
		if flag:
			if s[i] != '0':
				flag = False
				truei = i
				i = len(s)
			else:
				i += 1
		else:
			i = len(s)
	try:
		return s[truei:]
	except:
		return '0'
s = str(input())
t = str(input())
s = reduc(s)
t = reduc(t)
if len(s) > len(t):
	print('>')
elif len(s) < len(t):
	print('<')
else:
	flag = True
	i = 0
	while flag and i < len(s):
		if s[i] > t[i]:
			print('>')
			flag = False
		elif s[i] < t[i]:
			print('<')
			flag = False
		else:
			i += 1
	if flag:
		print('=')


a = input()
b = input()
count1 = 0
for (i, x) in enumerate(a):
	if x == '0':
		count1 += 1
		pass
	else:
		c = i
		break
count2 = 0
for (i, x) in enumerate(b):
	if x == '0':
		count2 += 1
		pass
	else:
		d = i
		break
if len(a) == count1 and len(b) == count2:
	print('=')
elif len(a) - count1 > len(b) - count2:
	print('>')
elif len(a) - count1 == len(b) - count2:
	lst = []
	for x in range(len(a) - count1):
		if a[count1 + x] > b[count2 + x]:
			print('>')
			break
		elif a[count1 + x] < b[count2 + x]:
			print('<')
			break
		else:
			lst.append(a[x])
	if len(lst) == len(a) - count1:
		print('=')
elif len(a) - count1 < len(b) - count2:
	print('<')


import sys

def removePreceedingZeros(x):
	for y in range(0, len(x)):
		if x[y] != '0':
			break
	return x[y:]

def xcompare(x, y):
	for u in range(0, len(x)):
		if x[u] > y[u]:
			return '>'
		if x[u] < y[u]:
			return '<'
	return '='
a = list(input())
b = list(input())
a = removePreceedingZeros(a)
b = removePreceedingZeros(b)
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	print(xcompare(a, b))


import sys
input = sys.stdin.readline
inst = lambda : input().rstrip('\n\r')
inin = lambda : int(input())
inar = lambda : list(map(int, input().split()))
a = inst().lstrip('0')
b = inst().lstrip('0')
if len(a) < len(b):
	print('<')
elif len(a) > len(b):
	print('>')
elif a < b:
	print('<')
elif a > b:
	print('>')
else:
	print('=')


a = input()
b = input()
if a.count('0') == len(a) and b.count('0') == len(b):
	print('=')
	exit()
a = a.lstrip('0')
b = b.lstrip('0')
if len(a) > len(b):
	print('>')
elif len(b) > len(a):
	print('<')
else:
	for i in range(len(a)):
		if int(a[i]) > int(b[i]):
			print('>')
			break
		elif int(a[i]) < int(b[i]):
			print('<')
			break
		elif i == len(a) - 1:
			print('=')
			break


digits_pos = {'0': 0, '1': 1, '2': 2, '3': 3, '4': 4, '5': 5, '6': 6, '7': 7, '8': 8, '9': 9}
integer_1 = input().lstrip('0')
integer_2 = input().lstrip('0')
length_1 = len(integer_1)
length_2 = len(integer_2)
if length_2 == length_1:
	for i in range(length_1):
		if digits_pos[integer_2[i]] > digits_pos[integer_1[i]]:
			print('<')
			exit()
		elif digits_pos[integer_1[i]] > digits_pos[integer_2[i]]:
			print('>')
			exit()
	print('=')
else:
	print('>' if length_1 > length_2 else '<')


a = input()
b = input()
la = len(a)
lb = len(b)
for i in range(la):
	if a[i] != '0':
		break
a = a[i:]
la -= i
for i in range(lb):
	if b[i] != '0':
		break
b = b[i:]
lb -= i
if la > lb:
	print('>')
elif lb > la:
	print('<')
else:
	equal = True
	for i in range(la):
		ai = a[i]
		bi = b[i]
		if ai != bi:
			equal = False
			print('>' if ai > bi else '<')
			break
	if equal:
		print('=')


a = input()
b = input()
a = a.lstrip('0')
b = b.lstrip('0')
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	for (x, y) in zip(a, b):
		if int(x) > int(y):
			print('>')
			exit(0)
		elif int(x) < int(y):
			print('<')
			exit(0)
	print('=')


(a, b) = (input(), input())
size = max(len(a), len(b))
a = a.zfill(size)
b = b.zfill(size)
if a < b:
	print('<')
elif a == b:
	print('=')
else:
	print('>')


exec('a,b=' + 2 * 'input().rjust(10**6,"0"),')
print('<>='[(a == b) + (a >= b)])


a = input()
b = input()
m = 0
n = 0
flag = 0
for i in a:
	if i == '0':
		m += 1
	else:
		break
for i in b:
	if i == '0':
		n += 1
	else:
		break
if m == len(a) and n == len(b):
	print('=')
elif m == len(a):
	print('<')
elif n == len(b):
	print('>')
elif len(a[m:]) < len(b[n:]):
	print('<')
elif len(a[m:]) > len(b[n:]):
	print('>')
else:
	for i in range(len(a[m:])):
		if a[m + i] < b[n + i]:
			print('<')
			flag = 1
			break
		elif a[m + i] > b[n + i]:
			print('>')
			flag = 1
			break
		else:
			continue
	if flag == 0:
		print('=')


a = input()
b = input()

def to_string(x):
	new = ''
	for i in x:
		if i != '!':
			new += i
	return new

def nah(x):
	x = list(x)
	for i in range(len(x)):
		if x[i] == '0':
			x[i] = '!'
		else:
			break
	return to_string(x)
a = nah(a)
b = nah(b)
if len(a) > len(b):
	print('>')
elif len(b) > len(a):
	print('<')
else:
	for i in range(len(a)):
		inted_a = int(a[i])
		inted_b = int(b[i])
		if inted_a > inted_b:
			print('>')
			exit()
		elif inted_b > inted_a:
			print('<')
			exit()
	print('=')


a = input()
b = input()
(i, j) = (0, 0)
while i < len(a) and a[i] == '0':
	i += 1
while j < len(b) and b[j] == '0':
	j += 1
if len(a) - i > len(b) - j:
	print('>')
elif len(b) - j > len(a) - i:
	print('<')
else:
	while i < len(a):
		if int(a[i]) > int(b[j]):
			print('>')
			break
		elif int(a[i]) < int(b[j]):
			print('<')
			break
		i += 1
		j += 1
	else:
		print('=')


import math
a = input()
b = input()
if len(a) > len(b):
	b = '0' * int(math.fabs(len(a)) - len(b)) + b
elif len(a) < len(b):
	a = '0' * int(math.fabs(len(a) - len(b))) + a
if a > b:
	print('>')
elif a < b:
	print('<')
else:
	print('=')


def long_numbers(s, t):
	m = max(len(s), len(t))
	for i in range(m):
		sn = '0'
		if len(s) - m + i >= 0:
			sn = s[len(s) - m + i]
		tn = '0'
		if len(t) - m + i >= 0:
			tn = t[len(t) - m + i]
		if sn < tn:
			return '<'
		if sn > tn:
			return '>'
	return '='
s1 = input()
s2 = input()
print(long_numbers(s1, s2))


def cut(s):
	i = 0
	ans = s
	for d in s:
		if d == '0':
			i = i + 1
		else:
			break
	ans = s[i:]
	return ans
a1 = input()
b1 = input()
a = cut(a1)
b = cut(b1)
nmn = True
if len(a) > len(b):
	print('>')
	nmn = False
elif len(a) < len(b):
	print('<')
	nmn = False
else:
	for i in range(len(a)):
		if a[i] > b[i]:
			print('>')
			nmn = False
			break
		elif a[i] < b[i]:
			print('<')
			nmn = False
			break
if nmn:
	print('=')


a = input()
b = input()
j = 0
for i in range(len(a)):
	if a[i] == '0':
		j += 1
	else:
		break
a = a[j:]
j = 0
for i in range(len(b)):
	if b[i] == '0':
		j += 1
	else:
		break
b = b[j:]
flag = 0
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	for i in range(len(a)):
		if a[i] > b[i]:
			flag = 1
			break
		elif a[i] < b[i]:
			flag = 2
			break
		else:
			continue
	if flag == 0:
		print('=')
	elif flag == 1:
		print('>')
	else:
		print('<')


a = input().lstrip('0')
b = input().lstrip('0')
if len(a) < len(b):
	print('<')
elif len(a) > len(b):
	print('>')
else:
	flag = False
	for i in range(len(a)):
		if a[i] < b[i]:
			print('<')
			flag = True
			break
		elif a[i] > b[i]:
			print('>')
			flag = True
			break
	if not flag:
		print('=')


try:
	while True:
		a = input().lstrip('0')
		b = input().lstrip('0')
		if not a:
			a = '0'
		if not b:
			b = '0'
		if len(a) < len(b):
			print('<')
		elif len(a) > len(b):
			print('>')
		else:
			for (c, d) in zip(a, b):
				if c != d:
					print('<' if c < d else '>')
					break
			else:
				print('=')
except EOFError:
	pass


a = input().lstrip('0')
b = input().lstrip('0')
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	for (i, j) in zip(a, b):
		if i > j:
			print('>')
			break
		elif i < j:
			print('<')
			break
	else:
		print('=')


from sys import stdin
a = stdin.readline().rstrip('\n').lstrip('0').rjust(10 ** 6, '0')
b = stdin.readline().rstrip('\n').lstrip('0').rjust(10 ** 6, '0')
print('>') if a > b else print('<') if a < b else print('=')


a = input()
s = input()
if len(a) > len(s):
	s = '0' * (len(a) - len(s)) + s
elif len(a) < len(s):
	a = '0' * (len(s) - len(a)) + a
if a > s:
	print('>')
elif a < s:
	print('<')
else:
	print('=')


(a, b) = (input(), input())
z = abs(len(a) - len(b))
if len(a) > len(b):
	b = '0' * z + b
else:
	a = '0' * z + a
print('>' if a > b else '<' if a < b else '=')


def finish(s):
	print(s)
	import sys
	sys.exit()
(a, b) = (input(), input())
(an, bn) = (len(a), len(b))
(ai, bi) = (0, 0)
while a[ai] == '0' and ai + 1 < an:
	ai += 1
while b[bi] == '0' and bi + 1 < bn:
	bi += 1
if an - ai > bn - bi:
	finish('>')
if an - ai < bn - bi:
	finish('<')
while True:
	if a[ai] > b[bi]:
		finish('>')
	if a[ai] < b[bi]:
		finish('<')
	if ai + 1 == an:
		finish('=')
	ai += 1
	bi += 1


a = input().lstrip('0')
b = input().lstrip('0')
dlinaA = len(a)
dlinaB = len(b)
if dlinaA == 0:
	a = '0'
if dlinaB == 0:
	b = '0'
if dlinaA == 0 and dlinaB == 0:
	print('=')
if dlinaA > dlinaB:
	print('>')
elif dlinaA < dlinaB:
	print('<')
else:
	for i in range(dlinaA):
		if int(a[i]) > int(b[i]):
			print('>')
			break
		elif int(a[i]) < int(b[i]):
			print('<')
			break
		elif i == dlinaA - 1:
			print('=')
			break


n = input()
m = input()
for i in range(len(n)):
	if n[i] != '0':
		n = n[i:]
		break
x = True
for i in range(len(m)):
	if m[i] != '0':
		m = m[i:]
		break
if m == '0' * len(m):
	m = '0'
if n == '0' * len(n):
	n = '0'
if len(n) > len(m):
	x = False
	print('>')
elif len(n) < len(m):
	x = False
	print('<')
else:
	for i in range(len(m)):
		if int(n[i]) > int(m[i]):
			print('>')
			x = False
			break
		if int(n[i]) < int(m[i]):
			print('<')
			x = False
			break
if x:
	print('=')


import sys
a = input()
b = input()
ai = 0
bi = 0
while ai < len(a) and a[ai] == '0':
	ai += 1
while bi < len(b) and b[bi] == '0':
	bi += 1
l1 = len(a) - ai
l2 = len(b) - bi
if l1 > l2:
	print('>')
	sys.exit()
if l1 < l2:
	print('<')
	sys.exit()
if a[ai:] > b[bi:]:
	print('>')
elif a[ai:] < b[bi:]:
	print('<')
else:
	print('=')


def main():
	a = str(input())
	b = str(input())
	aa = len(a)
	bb = len(b)
	if aa > bb:
		c = ''
		for i in range(aa - bb):
			c += '0'
		b = c + b
	elif aa < bb:
		c = ''
		for i in range(bb - aa):
			c += '0'
		a = c + a
	if a > b:
		print('>')
	elif a < b:
		print('<')
	else:
		print('=')
main()


def trim(s):
	if s == '':
		return s
	if s[0] != '0':
		return s
	stop = 0
	for i in range(len(s)):
		if s[i] != '0':
			stop = i
			break
	if stop == 0:
		return ''
	return s[stop:]
a = trim(input())
b = trim(input())
answer = ''
if len(a) > len(b):
	answer = '>'
if len(a) < len(b):
	answer = '<'
if answer == '':
	for i in range(len(a)):
		if a[i] == b[i]:
			continue
		if int(a[i]) > int(b[i]):
			answer = '>'
		else:
			answer = '<'
		break
if answer == '':
	answer = '='
print(answer)


a = input()
b = input()

def remove_zeroes(s: str):
	i = 0
	for x in range(len(s) - 1):
		if s[x] == '0':
			i += 1
		else:
			break
	return s[i:]
a = remove_zeroes(a)
b = remove_zeroes(b)
if len(a) != len(b):
	if len(a) > len(b):
		print('>')
	else:
		print('<')
	return
cmp1 = a > b
cmp2 = a < b
if cmp1:
	print('>')
elif cmp2:
	print('<')
else:
	print('=')


n = input()
m = input()
l = max(len(n), len(m))
dn = len(n) - l
dm = len(m) - l
for i in range(l):
	vn = '0'
	if dn + i >= 0:
		vn = n[dn + i]
	vm = '0'
	if dm + i >= 0:
		vm = m[dm + i]
	if vn < vm:
		print('<')
		exit(0)
	elif vn > vm:
		print('>')
		exit(0)
print('=')


def main():
	a = input().lstrip('0')
	b = input().lstrip('0')
	if len(a) != len(b):
		print('<' if len(a) < len(b) else '>')
	else:
		print('>' if a > b else '<' if a < b else '=')
main()


import sys
a = input()
b = input()
lenA = len(a)
lenB = len(b)
i = 0
while i < lenA and a[i] == '0':
	i += 1
j = 0
while j < lenB and b[j] == '0':
	j += 1
if i == lenA and j == lenB:
	print('=')
elif j == lenB or lenA - i > lenB - j:
	print('>')
elif i == lenA or lenA - i < lenB - j:
	print('<')
else:
	while i < lenA and a[i] == b[j]:
		i += 1
		j += 1
	if i == lenA:
		print('=')
	elif a[i] > b[j]:
		print('>')
	else:
		print('<')


a = input()
b = input()

def delL(inp):
	out = ''
	flag = False
	for i in inp:
		if i != '0':
			flag = True
		if flag:
			out = out + i
	if out == '':
		return '0'
	return out
a = delL(a)
b = delL(b)
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	flag = False
	for i in range(len(a)):
		if a[i] > b[i]:
			flag = True
			print('>')
			break
		elif a[i] < b[i]:
			flag = True
			print('<')
			break
	if flag == False:
		print('=')


import sys
import math
import itertools
import collections

def sieve(n):
	if n < 2:
		return list()
	prime = [True for _ in range(n + 1)]
	p = 3
	while p * p <= n:
		if prime[p]:
			for i in range(p * 2, n + 1, p):
				prime[i] = False
		p += 2
	r = [2]
	for p in range(3, n + 1, 2):
		if prime[p]:
			r.append(p)
	return r

def divs(n, start=1):
	r = []
	for i in range(start, int(math.sqrt(n) + 1)):
		if n % i == 0:
			if n / i == i:
				r.append(i)
			else:
				r.extend([i, n // i])
	return r

def prime(n):
	if n == 2:
		return True
	if n % 2 == 0 or n <= 1:
		return False
	sqr = int(math.sqrt(n)) + 1
	for d in range(3, sqr, 2):
		if n % d == 0:
			return False
	return True

def convn(number, base):
	newnumber = 0
	while number > 0:
		newnumber += number % base
		number //= base
	return newnumber

def cdiv(n, k):
	return n // k + (n % k != 0)

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return list(map(int, input().split()))

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

def wr(arr):
	return '\n'.join(map(str, arr))

def revn(n):
	return str(n)[::-1]

def dd():
	return collections.defaultdict(int)

def ddl():
	return collections.defaultdict(list)
a = input()
b = input()
mls = max(len(a), len(b))
a = a.zfill(mls)
b = b.zfill(mls)
if a < b:
	print('<')
elif a > b:
	print('>')
else:
	print('=')


a = input()
b = input()
i = 0
stop = False
while i < len(a) and stop == False:
	if a[i] != '0':
		stop = True
	i += 1
a = a[i - 1:]
i = 0
stop = False
while i < len(b) and stop == False:
	if b[i] != '0':
		stop = True
	i += 1
b = b[i - 1:]
if a == b:
	print('=')
elif len(a) == len(b):
	i = 0
	stop = False
	while i < len(a) and stop == False:
		if int(b[i]) > int(a[i]):
			print('<')
			stop = True
		elif int(b[i]) < int(a[i]):
			print('>')
			stop = True
		i += 1
elif len(b) > len(a):
	print('<')
else:
	print('>')


first_integer = input()
second_integer = input()
len_first = len(first_integer)
len_second = len(second_integer)
max_len = max(len_first, len_second)
if len_first < len_second:
	first_integer = '0' * (len_second - len_first) + first_integer
elif len_first > len_second:
	second_integer = '0' * (len_first - len_second) + second_integer
for i in range(max_len):
	if first_integer[i] < second_integer[i]:
		print('<')
		exit(0)
	elif first_integer[i] > second_integer[i]:
		print('>')
		exit(0)
print('=')


str1 = input()
str2 = input()
st1 = 0
st2 = 0
while st1 < len(str1) and str1[st1] == '0':
	st1 += 1
while st2 < len(str2) and str2[st2] == '0':
	st2 += 1
if len(str1) - st1 < len(str2) - st2:
	print('<')
elif len(str1) - st1 > len(str2) - st2:
	print('>')
else:
	while st1 < len(str1) and st2 < len(str2):
		if str1[st1] < str2[st2]:
			st1 = 10000000
			st2 = 10000000
			print('<')
		elif str1[st1] > str2[st2]:
			st1 = 10000000
			st2 = 10000000
			print('>')
		else:
			st1 += 1
			st2 += 1
	if st1 != 10000000:
		print('=')


def function():
	a = str(input()).lstrip('0')
	b = str(input()).lstrip('0')
	if len(a) > len(b):
		return '>'
	elif len(a) < len(b):
		return '<'
	for index in range(len(a)):
		if int(a[index]) < int(b[index]):
			return '<'
		elif int(a[index]) > int(b[index]):
			return '>'
	return '='
print(function())


import sys
import math
a = input()
b = input()
a = '0' * max(len(b) - len(a), 0) + a
b = '0' * max(len(a) - len(b), 0) + b
if a == b:
	print('=')
elif a < b:
	print('<')
else:
	print('>')


a = input()
b = input()
la = len(a)
lb = len(b)
ans = '='
if la > lb:
	b = (la - lb) * '0' + b
elif lb > la:
	a = (lb - la) * '0' + a
for i in range(max(lb, la)):
	if a[i] > b[i]:
		ans = '>'
		break
	elif b[i] > a[i]:
		ans = '<'
		break
print(ans)


a = input()
b = input()
(n, m) = (len(a), len(b))
if n > m:
	b = '0' * (n - m) + b
else:
	a = '0' * (m - n) + a
i = 0
while i < max(n, m) and a[i] == b[i]:
	i += 1
print('=' if i == max(n, m) else '<' if int(a[i]) < int(b[i]) else '>')


a = str(input())
b = str(input())
for i in range(len(a)):
	if a[i] != '0':
		a = a[i:]
		break
else:
	a = '0'
for i in range(len(b)):
	if b[i] != '0':
		b = b[i:]
		break
else:
	b = '0'
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	for i in range(len(a)):
		if int(a[i]) > int(b[i]):
			print('>')
			exit()
		if int(a[i]) < int(b[i]):
			print('<')
			exit()
	else:
		print('=')


a = input()
b = input()
(acount, bcount) = (0, 0)
for i in a:
	if i == '0':
		acount += 1
	else:
		break
for i in b:
	if i == '0':
		bcount += 1
	else:
		break
a = a.replace('0', '', acount)
b = b.replace('0', '', bcount)
if len(a) == len(b):
	for (i, j) in zip(a, b):
		if i > j:
			print('>')
			exit()
		elif i < j:
			print('<')
			exit()
	print('=')
elif len(a) > len(b):
	print('>')
else:
	print('<')


a = input()
b = input()
if a[0] == '0':
	a = int(a)
	a = str(a)
if b[0] == '0':
	b = int(b)
	b = str(b)
if len(a) == len(b):
	if a > b:
		print('>')
	elif a < b:
		print('<')
	else:
		print('=')
elif len(a) > len(b):
	print('>')
else:
	print('<')


def main():
	a = input()
	b = input()
	boolean = False
	index_to_start_a = 0
	index_to_start_b = 0
	while index_to_start_a < len(a) and a[index_to_start_a] == '0':
		index_to_start_a += 1
	while index_to_start_b < len(b) and b[index_to_start_b] == '0':
		index_to_start_b += 1
	a = a[index_to_start_a:]
	b = b[index_to_start_b:]
	length_a = len(a)
	length_b = len(b)
	if length_a > length_b:
		print('>')
	elif length_a < length_b:
		print('<')
	else:
		for k in range(length_a):
			if a[k] > b[k]:
				print('>')
				boolean = True
				break
			if a[k] < b[k]:
				print('<')
				boolean = True
				break
		if not boolean:
			print('=')
main()


a = input()
b = input()
a = a.lstrip('0')
b = b.lstrip('0')
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	f = 0
	for i in range(len(a)):
		if int(a[i]) - 48 > int(b[i]) - 48:
			print('>')
			f = 1
			break
		elif int(a[i]) - 48 < int(b[i]) - 48:
			print('<')
			f = 1
			break
	if f == 0:
		print('=')


a = input().lstrip('0')
b = input().lstrip('0')
if len(a) > len(b) or (len(a) == len(b) and a > b):
	print('>')
elif len(a) < len(b) or (len(a) == len(b) and a < b):
	print('<')
elif a == b:
	print('=')


def paddingleadingzeroes(s, t):
	if len(s) == len(t):
		return (s, t)
	elif len(s) > len(t):
		b = '0' * (len(s) - len(t)) + t
		return (s, b)
	else:
		b = '0' * (len(t) - len(s)) + s
		return (b, t)
a = str(input())
b = str(input())
(c, d) = paddingleadingzeroes(a, b)
if c > d:
	print('>')
elif c < d:
	print('<')
else:
	print('=')


import io, os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
inst = lambda : input().decode().rstrip('\n\r')
inin = lambda : int(input())
inar = lambda : list(map(int, input().split()))
a = inst().lstrip('0')
b = inst().lstrip('0')
if len(a) < len(b):
	print('<')
elif len(a) > len(b):
	print('>')
elif a < b:
	print('<')
elif a > b:
	print('>')
else:
	print('=')


def c(a, b):
	for (x, y) in zip(a, b):
		if x > y:
			return '>'
		elif x < y:
			return '<'
	return '='
(a, b) = (input(), input())
if len(a) < len(b):
	a = '0' * (len(b) - len(a)) + a
elif len(a) > len(b):
	b = '0' * (len(a) - len(b)) + b
print(c(a, b))


first = list(reversed(input()))
second = list(reversed(input()))
mx = max(len(first), len(second))
while len(first) < mx:
	first.append('0')
while len(second) < mx:
	second.append('0')
first.reverse()
second.reverse()
if first == second:
	print('=')
elif first > second:
	print('>')
else:
	print('<')


n1 = input()
n2 = input()
index = 0
for i in n1:
	if i == '0':
		index += 1
	else:
		break
n1 = n1[index:len(n1)]
index = 0
for i in n2:
	if i == '0':
		index += 1
	else:
		break
n2 = n2[index:len(n2)]
if len(n1) > len(n2):
	print('>')
elif len(n2) > len(n1):
	print('<')
else:
	for i in range(len(n1)):
		if n1[i] > n2[i]:
			print('>')
			break
		elif n2[i] > n1[i]:
			print('<')
			break
	else:
		print('=')


a = input()
b = input()
i = 0
while i < len(a) - 1 and a[i] == '0':
	i += 1
a = a[i:]
i = 0
while i < len(b) - 1 and b[i] == '0':
	i += 1
b = b[i:]
if len(a) < len(b):
	print('<')
elif len(a) > len(b):
	print('>')
else:
	i = 0
	while i < len(a) and a[i] == b[i]:
		i += 1
	if i == len(a):
		print('=')
	elif a[i] > b[i]:
		print('>')
	else:
		print('<')


import sys
fin = sys.stdin
(a, b) = (fin.readline().rstrip().lstrip('0'), fin.readline().rstrip().lstrip('0'))
if len(a) < len(b):
	print('<')
elif len(a) > len(b):
	print('>')
else:
	for i in range(len(a)):
		if a[i] == b[i]:
			continue
		elif a[i] < b[i]:
			print('<')
			break
		else:
			print('>')
			break
	else:
		print('=')


from sys import stdin, stdout, exit
a = stdin.readline()
b = stdin.readline()
i1 = len(a)
i2 = len(b)
for i in range(len(a)):
	if a[i] != '0':
		i1 = i
		break
for i in range(len(b)):
	if b[i] != '0':
		i2 = i
		break
if len(a) - i1 < len(b) - i2:
	stdout.write('<')
	exit(0)
elif len(a) - i1 > len(b) - i2:
	stdout.write('>')
	exit(0)
while i1 < len(a) - 1:
	if ord(a[i1]) < ord(b[i2]):
		stdout.write('<')
		exit(0)
	elif ord(a[i1]) > ord(b[i2]):
		stdout.write('>')
		exit(0)
	i1 += 1
	i2 += 1
stdout.write('=')


a = input().lstrip('0')
b = input().lstrip('0')
(Size1, Size2) = (len(a), len(b))
if Size1 == Size2:
	print('=' if a == b else '<' if a < b else '>')
else:
	print('<' if Size2 > Size1 else '>')


a = input()
b = input()
al = len(a)
bl = len(b)
i = 0
while i < al and a[i] == '0':
	i += 1
j = 0
while j < bl and b[j] == '0':
	j += 1
if al - i < bl - j:
	print('<')
elif al - i > bl - j:
	print('>')
else:
	while i < al and j < bl and (a[i] == b[j]):
		i += 1
		j += 1
	if i == al:
		print('=')
	elif int(a[i]) > int(b[j]):
		print('>')
	elif int(a[i]) < int(b[j]):
		print('<')
	else:
		print('=')


s1 = input()
s2 = input()
x1 = 0
x2 = 0
for i in range(0, len(s1)):
	if s1[i] == '0':
		x1 += 1
	else:
		break
for i in range(0, len(s2)):
	if s2[i] == '0':
		x2 += 1
	else:
		break
if x1 == len(s1) and x2 == len(s2):
	print('=')
elif x1 == len(s1):
	print('<')
elif x2 == len(s2):
	print('>')
elif len(s1[x1:]) > len(s2[x2:]):
	print('>')
elif len(s1[x1:]) < len(s2[x2:]):
	print('<')
else:
	flag1 = 0
	for i in range(0, len(s1[x1:])):
		if s1[x1 + i] > s2[x2 + i]:
			print('>')
			flag1 = 1
			break
		elif s1[x1 + i] < s2[x2 + i]:
			print('<')
			flag1 = 1
			break
	if flag1 == 0:
		print('=')


a = input()
b = input()
aa = ''
bb = ''
ai = 0
bi = 0
while ai < len(a):
	if a[ai] == '0':
		ai += 1
	else:
		break
while bi < len(b):
	if b[bi] == '0':
		bi += 1
	else:
		break
ra = a[ai:]
rb = b[bi:]
if len(ra) > len(rb):
	print('>')
elif len(ra) < len(rb):
	print('<')
else:
	i = 0
	eq = True
	while i < len(ra):
		if ra[i] > rb[i]:
			print('>')
			eq = False
			break
		elif ra[i] < rb[i]:
			print('<')
			eq = False
			break
		i += 1
	if eq:
		print('=')


def clz(s):
	n = 0
	for i in range(len(s)):
		if s[i] == '0':
			n += 1
		else:
			break
	return n

def solve():
	A = input()
	B = input()
	lza = clz(A)
	lzb = clz(B)
	la = len(A) - lza
	lb = len(B) - lzb
	if la > lb:
		print('>')
	elif la < lb:
		print('<')
	else:
		for i in range(la):
			if A[lza + i] > B[lzb + i]:
				print('>')
				break
			elif A[lza + i] < B[lzb + i]:
				print('<')
				break
		else:
			print('=')
solve()


a = input()
b = input()
len_a = len(a)
len_b = len(b)
maxlen = max(len_a, len_b)
if len_a < maxlen:
	a = '0' * (maxlen - len_a) + a
if len_b < maxlen:
	b = '0' * (maxlen - len_b) + b
if a < b:
	print('<')
elif a > b:
	print('>')
else:
	print('=')


a = input()
b = input()
m = len(a)
n = len(b)
i = j = 0
while i < m and a[i] == '0':
	i += 1
while j < n and b[j] == '0':
	j += 1
_m = m - i
_n = n - j
res = ''
if _m > _n:
	res = '>'
elif _m < _n:
	res = '<'
else:
	k = 0
	while k < _m and a[i + k] == b[j + k]:
		k += 1
	if k == _m:
		res = '='
	elif a[i + k] > b[j + k]:
		res = '>'
	else:
		res = '<'
print(res)


import sys
a = input()
b = input()
(l1, l2) = (len(a), len(b))
(a1, b1) = ((l2 > l1) * (l2 - l1) * '0' + a, (l1 > l2) * (l1 - l2) * '0' + b)
for i in range(len(a1)):
	if a1[i] == b1[i]:
		continue
	if a1[i] > b1[i]:
		print('>')
		sys.exit()
	if a1[i] < b1[i]:
		print('<')
		sys.exit()
print('=')


a = input()
b = input()
aLen = 0
for i in range(len(a)):
	if a[i] != '0':
		aLen = i
		break
	if i == len(a) - 1:
		a = '0'
		break
a = a[aLen:]
bLen = 0
for i in range(len(b)):
	if b[i] != '0':
		bLen = i
		break
	if i == len(b) - 1:
		b = '0'
		break
b = b[bLen:]
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
elif a > b:
	print('>')
elif a < b:
	print('<')
else:
	print('=')


import sys
a = sys.stdin.readline().split()[0]
b = sys.stdin.readline().split()[0]
(i, j) = (0, 0)
if len(a) < len(b):
	a = '0' * (len(b) - len(a)) + a
else:
	b = '0' * (len(a) - len(b)) + b
while i < len(a) and j < len(b) and (a[i] == b[j]):
	i += 1
	j += 1
if i == len(a) and j == len(b):
	print('=')
elif j == len(b):
	print('>')
elif i == len(a):
	print('<')
else:
	print('<' if a[i] < b[j] else '>')


from collections import deque as de
import math
from collections import Counter as cnt
from functools import reduce
from typing import MutableMapping

def factors(n):
	return set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0)))

class My_stack:

	def __init__(self):
		self.data = []

	def my_push(self, x):
		return self.data.append(x)

	def my_pop(self):
		return self.data.pop()

	def my_peak(self):
		return self.data[-1]

	def my_contains(self, x):
		return self.data.count(x)

	def my_show_all(self):
		return self.data

	def isEmpty(self):
		return len(self.data) == 0
arrStack = My_stack()

def decimalToBinary(n):
	return bin(n).replace('0b', '')

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True

def get_prime_factors(number):
	prime_factors = []
	while number % 2 == 0:
		prime_factors.append(2)
		number = number / 2
	for i in range(3, int(math.sqrt(number)) + 1, 2):
		while number % i == 0:
			prime_factors.append(int(i))
			number = number / i
	if number > 2:
		prime_factors.append(int(number))
	return prime_factors

def get_frequency(list):
	dic = {}
	for ele in list:
		if ele in dic:
			dic[ele] += 1
		else:
			dic[ele] = 1
	return dic

def Log2(x):
	return math.log10(x) / math.log10(2)

def isPowerOfTwo(n):
	return math.ceil(Log2(n)) == math.floor(Log2(n))
a = input()
b = input()
aa = a.lstrip('0')
bb = b.lstrip('0')
if len(aa) > len(bb):
	print('>')
elif len(aa) < len(bb):
	print('<')
else:
	ch = 1
	for i in range(len(aa)):
		if int(aa[i]) > int(bb[i]):
			print('>')
			ch = 0
			break
		elif int(aa[i]) < int(bb[i]):
			print('<')
			ch = 0
			break
	if ch:
		print('=')


def remove_leading_zeros(n):
	index = 0
	while index < len(n) and n[index] == '0':
		index += 1
	return n[index:]

def solve(a, b):
	a = remove_leading_zeros(a)
	b = remove_leading_zeros(b)
	if len(a) > len(b):
		return '>'
	elif len(a) < len(b):
		return '<'
	index = 0
	while index < len(a):
		if a[index] > b[index]:
			return '>'
		elif a[index] < b[index]:
			return '<'
		index += 1
	return '='
assert solve('9', '10') == '<'
assert solve('11', '10') == '>'
assert solve('00012345', '12345') == '='
assert solve('0123', '9') == '>'
assert solve('0123', '111') == '>'
a = input().strip()
b = input().strip()
print(solve(a, b))


a = input()
b = input()
la = len(a)
lb = len(b)
for i in range(la):
	if a[i] != '0':
		fa = i
		break
	if i == la - 1:
		fa = la
for i in range(lb):
	if b[i] != '0':
		fb = i
		break
	if i == lb - 1:
		fb = lb
flag = 1
if la - fa > lb - fb:
	print('>')
	flag = 0
elif la - fa < lb - fb:
	print('<')
	flag = 0
else:
	for i in range(la - fa):
		if int(a[i + fa]) > int(b[i + fb]):
			print('>')
			flag = 0
			break
		elif int(a[i + fa]) < int(b[i + fb]):
			print('<')
			flag = 0
			break
if flag == 1:
	print('=')


from collections import deque
from sys import stdin
a = input()
b = input()
i = 0
j = 0
allen = len(a)
bllen = len(b)
while i < allen and a[i] == '0':
	i += 1
while j < bllen and b[j] == '0':
	j += 1
alen = allen - i
blen = bllen - j
m = min(alen, blen)

def cmp(a, b, i, j):
	if alen > blen:
		return '>'
	elif alen < blen:
		return '<'
	while i < allen and j < bllen:
		if a[i] < b[j]:
			return '<'
		elif a[i] > b[j]:
			return '>'
		i += 1
		j += 1
	return '='
print(cmp(a, b, i, j))


def nol(x):
	if x == '0' * len(x):
		return '0'
	y = 0
	while x[y] == '0':
		y += 1
	return x[y:]
a = nol(input())
b = nol(input())
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	k = True
	for i in range(len(a)):
		if a[i] == b[i]:
			continue
		if int(a[i]) > int(b[i]):
			print('>')
			k = False
			break
		else:
			print('<')
			k = False
			break
	print('=') if k else None


from sys import stdin, stdout

def fun(a):
	ind = 0
	for i in range(len(a)):
		if a[i] != '0':
			ind = i
			break
	return a[ind:]

def fun1(a, b):
	if len(a) > len(b):
		return '>'
	if len(a) < len(b):
		return '<'
	ind = 0
	for i in range(len(a)):
		if a[i] != b[i]:
			ind = i
			break
	if a[i] == b[i]:
		return '='
	elif a[i] > b[i]:
		return '>'
	else:
		return '<'
a = stdin.readline()
b = stdin.readline()
a = fun(a)
b = fun(b)
print(fun1(a, b))


a = input()
b = input()
i = 0
j = 0
n = len(a)
m = len(b)
while i < n and a[i] == '0':
	i += 1
while j < m and b[j] == '0':
	j += 1
if n - i > m - j:
	print('>')
elif n - i < m - j:
	print('<')
else:
	while i < n:
		if a[i] > b[j]:
			print('>')
			break
		elif a[i] < b[j]:
			print('<')
			break
		else:
			i += 1
			j += 1
	else:
		print('=')


def solve(a, b):
	ai = 0
	while ai < len(a) and a[ai] == '0':
		ai += 1
	bi = 0
	while bi < len(b) and b[bi] == '0':
		bi += 1
	if len(a) - ai > len(b) - bi:
		print('>')
		return
	if len(b) - bi > len(a) - ai:
		print('<')
		return
	while ai < len(a):
		if int(a[ai]) > int(b[bi]):
			print('>')
			return
		if int(b[bi]) > int(a[ai]):
			print('<')
			return
		ai += 1
		bi += 1
	print('=')
a = input()
b = input()
solve(a, b)


a = input()
b = input()
for x in a:
	if x != '0':
		a = a[a.index(x):]
		break
else:
	a = '0'
for y in b:
	if y != '0':
		b = b[b.index(y):]
		break
else:
	b = '0'
if a == b:
	print('=')
elif len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
elif a > b:
	print('>')
elif a < b:
	print('<')


def f(x):
	for i in range(len(x)):
		if x[i] != '0':
			return x[i:]
	return '0'
x = input()
y = input()
a = f(x)
b = f(y)
if len(a) < len(b):
	print('<')
	exit()
elif len(a) > len(b):
	print('>')
	exit()
else:
	for (k, g) in zip(a, b):
		if int(k) > int(g):
			print('>')
			exit()
		elif int(k) < int(g):
			print('<')
			exit()
print('=')


a = str(input())
b = str(input())
x = abs(len(a) - len(b))
if len(a) < len(b):
	a = '0' * x + a
else:
	b = '0' * x + b
if a < b:
	print('<')
elif a == b:
	print('=')
else:
	print('>')


n1 = input().rjust(10 ** 6, '0')
n2 = input().rjust(10 ** 6, '0')
if n1 > n2:
	print('>')
elif n1 == n2:
	print('=')
else:
	print('<')


a = list(input().rstrip())
b = list(input().rstrip())
(la, lb) = (len(a), len(b))
(la0, lb0) = (0, 0)
for i in range(la):
	if not a[i] == '0':
		la0 = la - i
		ai = i
		break
for i in range(lb):
	if not b[i] == '0':
		lb0 = lb - i
		bi = i
		break
if la0 > lb0:
	print('>')
	exit()
elif la0 < lb0:
	print('<')
	exit()
else:
	for _ in range(la0):
		if int(a[ai]) > int(b[bi]):
			print('>')
			exit()
		if int(a[ai]) < int(b[bi]):
			print('<')
			exit()
		ai += 1
		bi += 1
print('=')


from itertools import zip_longest
a_ = input()
b_ = input()
result = '='
for (a, b) in zip_longest(a_[::-1], b_[::-1]):
	if b is None and a != '0' or (a and b and (a > b)):
		result = '>'
	elif a is None and b != '0' or (a and b and (b > a)):
		result = '<'
print(result)


a = input().lstrip('0')
b = input().lstrip('0')
if len(a) != len(b):
	print('>' if len(a) > len(b) else '<')
else:
	print('>' if a > b else '<' if a < b else '=')


def solve(a, b):
	i = 0
	j = 0
	while a[i] == '0' and len(a) - 1 > i:
		i += 1
	while b[j] == '0' and len(b) - 1 > j:
		j += 1
	if len(a[i:]) < len(b[j:]):
		return '<'
	if len(a[i:]) > len(b[j:]):
		return '>'
	while i < len(a):
		if int(a[i]) < int(b[j]):
			return '<'
		if int(a[i]) > int(b[j]):
			return '>'
		i += 1
		j += 1
	return '='
a = input()
b = input()
print(solve(a, b))


a = input()
b = input()
pa = 0
while pa < len(a) and a[pa] == '0':
	pa += 1
pb = 0
while pb < len(b) and b[pb] == '0':
	pb += 1
if len(a) - pa < len(b) - pb:
	print('<')
elif len(a) - pa > len(b) - pb:
	print('>')
else:
	while pa < len(a) and pb < len(b) and (a[pa] == b[pb]):
		pa += 1
		pb += 1
	if pa == len(a) and pb == len(b):
		print('=')
	elif pa == len(a):
		print('<')
	elif pb == len(b):
		print('>')
	elif a[pa] < b[pb]:
		print('<')
	elif a[pa] > b[pb]:
		print('>')


import sys

def end(x, y):
	if x > y:
		print('>')
	elif x < y:
		print('<')
	else:
		print('=')
	sys.exit()

def lenrem0(x):
	o = len(x)
	for i in x:
		if i != '0':
			break
		o -= 1
	return o
a = input()
b = input()
lna = lenrem0(a)
lnb = lenrem0(b)
if lna != lnb:
	end(lna, lnb)
a = a[len(a) - lna:]
b = b[len(b) - lnb:]
for i in range(len(a)):
	if a[i] != b[i]:
		end(a[i], b[i])
print('=')


x = input()
y = input()
a = ''
b = ''
flag = 0
for i in range(0, len(x)):
	if flag != 0:
		a = a + x[i]
	elif x[i] != '0':
		flag = 1
		a = a + x[i]
flag = 0
for i in range(0, len(y)):
	if flag != 0:
		b = b + y[i]
	elif flag == 0 and y[i] == 0:
		continue
	elif y[i] != '0':
		flag = 1
		b = b + y[i]
len1 = len(a)
len2 = len(b)
if len1 > len2:
	print('>')
elif len2 > len1:
	print('<')
else:
	flag = 0
	for i in range(0, len1):
		if flag == 1:
			break
		if a[i] > b[i]:
			print('>')
			flag = 1
		elif b[i] > a[i]:
			print('<')
			flag = 1
	if flag == 0:
		print('=')


a = str(input())
b = str(input())
n = max(len(a), len(b))
a = a.zfill(n)
b = b.zfill(n)
if a == b:
	print('=')
elif a > b:
	print('>')
else:
	print('<')


a = input()
b = input()
firstNumber = []
secondNumber = []
if len(a) > len(b):
	for i in range(len(a) - len(b)):
		secondNumber.append(int(0))
	for i in range(len(b)):
		secondNumber.append(int(b[i]))
	for i in range(len(a)):
		firstNumber.append(int(a[i]))
else:
	for i in range(len(b) - len(a)):
		firstNumber.append(int(0))
	for i in range(len(a)):
		firstNumber.append(int(a[i]))
	for i in range(len(b)):
		secondNumber.append(int(b[i]))
i = 0
equal = True
while i < len(firstNumber):
	if firstNumber[i] != secondNumber[i]:
		equal = False
		break
	i += 1
if equal:
	print('=')
elif firstNumber[i] > secondNumber[i]:
	print('>')
else:
	print('<')


a = input()
b = input()
a = a.lstrip('0')
b = b.lstrip('0')
if a == '':
	a = '0'
else:
	pass
if b == '':
	b = '0'
else:
	pass
la = len(a)
lb = len(b)
if la > lb:
	print('>')
elif la < lb:
	print('<')
elif la == lb:
	i = 0
	while int(a[i]) == int(b[i]) and i + 1 != la:
		i += 1
	if i + 1 == la and int(a[i]) == int(b[i]):
		print('=')
	elif int(a[i]) < int(b[i]):
		print('<')
	elif int(a[i]) > int(b[i]):
		print('>')


n = input()
m = input()
n = n.lstrip('0')
m = m.lstrip('0')
if len(n) > len(m):
	print('>')
elif len(n) == len(m):
	if n > m:
		print('>')
	elif n == m:
		print('=')
	else:
		print('<')
else:
	print('<')


import sys
a = input().lstrip('0')
b = input().lstrip('0')
la = len(a)
lb = len(b)
if la == lb:
	i = 0
	while i < la and a[i] == b[i]:
		i += 1
	if i == la:
		print('=')
	elif a[i] > b[i]:
		print('>')
	else:
		print('<')
elif la > lb:
	print('>')
else:
	print('<')


a = input()
b = input()
p = len(a)
q = len(b)
if p < q:
	a = '0' * (q - p) + a
if p > q:
	b = '0' * (p - q) + b
for i in range(max(p, q)):
	if a[i] > b[i]:
		print('>')
		exit(0)
	if a[i] < b[i]:
		print('<')
		exit(0)
print('=')


def somme(x):
	som = 0
	for i in x:
		som += int(i)
	return som
a = input()
b = input()
a = a.lstrip('0')
b = b.lstrip('0')
k = 0
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
elif a == b:
	print('=')
else:
	while True:
		if int(a[k]) > int(b[k]):
			print('>')
			break
		if int(a[k]) < int(b[k]):
			print('<')
			break
		k += 1


(a, b) = (input(), input())
(a, b) = ('0' * (max(len(a), len(b)) - len(a)) + a, '0' * (max(len(a), len(b)) - len(b)) + b)
(i, j) = (0, 0)
while i < len(a) and a[i] == b[i]:
	i += 1
if i == len(a):
	print('=')
else:
	print('<' if a[i] < b[i] else '>')


a = input()
b = input()
masih = True
if len(a) > len(b):
	panjang = len(a)
else:
	panjang = len(b)
for i in range(panjang, 0, -1):
	x = '0'
	y = '0'
	if len(a) - i >= 0:
		x = a[len(a) - i]
	if len(b) - i >= 0:
		y = b[len(b) - i]
	if x > y:
		print('>')
		masih = False
		break
	elif x < y:
		print('<')
		masih = False
		break
if masih:
	print('=')


def preprocess(g):
	g = input()
	g = list(g)
	r = len(g) - 1
	for i in range(0, len(g)):
		if g[i] > '0':
			r = i
			break
	g = g[r:]
	return ''.join(g)
[g, h] = [1, 1]
g = preprocess(g)
h = preprocess(h)
if len(g) < len(h):
	print('<')
elif len(g) > len(h):
	print('>')
elif g < h:
	print('<')
elif g > h:
	print('>')
else:
	print('=')


a = str(input())
b = str(input())
len1 = len(a)
len2 = len(b)
first1 = -1
first2 = -1
for i in range(len1):
	if a[i] != '0' and first1 == -1:
		first1 = i
		break
for i in range(len2):
	if b[i] != '0' and first2 == -1:
		first2 = i
		break
flag = 0
if first1 == -1:
	first1 = len1 - 1
if first2 == -1:
	first2 = len2 - 1
if len1 - first1 > len2 - first2:
	flag = 1
	print('>')
elif len1 - first1 < len2 - first2:
	flag = 1
	print('<')
else:
	for i in range(first1, len1):
		if a[i] > b[i - first1 + first2]:
			flag = 1
			print('>')
			break
		elif a[i] < b[i - first1 + first2]:
			flag = 1
			print('<')
			break
if flag == 0:
	print('=')


import time

def nz(x):
	a = 0
	for i in range(len(x)):
		if x[i] == '0':
			a += 1
		else:
			break
	return x[a:]
a = list(input())
b = list(input())
start = time.time()
a = nz(a)
b = nz(b)
if len(a) == len(b):
	flag = True
	for i in range(len(a)):
		if a[i] < b[i]:
			print('<')
			flag = False
			break
		elif a[i] > b[i]:
			print('>')
			flag = False
			break
	if flag == True:
		print('=')
elif len(a) < len(b):
	print('<')
else:
	print('>')
finish = time.time()


a = input()
b = input()
na = len(a)
nb = len(b)
a = '0' * (max(na, nb) - na) + a
b = '0' * (max(na, nb) - nb) + b
if a == b:
	print('=')
elif a > b:
	print('>')
else:
	print('<')


def f(a, b):
	if a == '':
		a = '0'
	if b == '':
		b = '0'
	if len(a) > len(b):
		return '>'
	elif len(b) > len(a):
		return '<'
	else:
		for i in range(max(len(a), len(b))):
			if a[i] > b[i]:
				return '>'
			elif a[i] < b[i]:
				return '<'
	return '='
a = input().lstrip('0')
b = input().lstrip('0')
print(f(a, b))


a = input()
b = input()
i = 0
for s in a:
	if s == '0':
		i += 1
	else:
		break
a = a[i:]
i = 0
for s in b:
	if s == '0':
		i += 1
	else:
		break
b = b[i:]
if len(a) > len(b):
	print('>')
elif len(b) > len(a):
	print('<')
else:
	equal = True
	for i in range(len(a)):
		if a[i] != b[i]:
			equal = False
			print('>' if a[i] > b[i] else '<')
			break
	if equal:
		print('=')


aa = input()
bb = input()
aa = aa.lstrip('0')
bb = bb.lstrip('0')
la = len(aa)
lb = len(bb)
flag = 0
if la > lb:
	print('>')
elif la < lb:
	print('<')
else:
	for i in range(la):
		if aa[i] > bb[i]:
			print('>')
			flag = 1
			break
		elif aa[i] < bb[i]:
			print('<')
			flag = 1
			break
	if flag == 0:
		print('=')


(a, b) = (input().lstrip('0'), input().lstrip('0'))
(n, m) = (len(a), len(b))
if n == m:
	print('=' if a == b else '<' if a < b else '>')
else:
	print('<' if n < m else '>')


from sys import stdin
a = stdin.readline().strip()
b = stdin.readline().strip()
x = len(a) - 1
y = len(b) - 1
for i in range(len(a)):
	if a[i] != '0':
		x = i
		break
for i in range(len(b)):
	if b[i] != '0':
		y = i
		break
a = a[x:]
b = b[y:]
if a == b:
	print('=')
elif len(a) > len(b) or (len(a) == len(b) and a > b):
	print('>')
else:
	print('<')


A = input()
B = input()
if len(A) != len(B):
	X = len(A) - len(B)
	if X > 0:
		B = '0' * X + B
	else:
		A = '0' * abs(X) + A
Bool = False
Ans = 0
for (a, b) in zip(A, B):
	if a != b:
		Bool = True
		if int(a) > int(b):
			Ans = 0
		else:
			Ans = 1
		break
if Bool == False:
	print('=')
elif Ans == 0:
	print('>')
else:
	print('<')


a = input().rjust(10 ** 6, '0')
b = input().rjust(10 ** 6, '0')
s = ('<', '>')
for (x, y) in zip(a, b):
	d = ord(x) - ord(y)
	if d:
		print(s[d > 0])
		exit(0)
print('=')


a = input().lstrip('0')
b = input().lstrip('0')
len1 = len(a)
len2 = len(b)
if len1 == len2:
	if a > b:
		print('>')
	elif a < b:
		print('<')
	else:
		print('=')
elif len1 > len2:
	print('>')
else:
	print('<')


a = input()
i = 0
flag = 0
b = input()
if a[0] == '0':
	a = a.lstrip('0')
if b[0] == '0':
	b = b.lstrip('0')
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	for elem in a:
		if elem > b[i]:
			print('>')
			flag = 1
			break
		elif elem < b[i]:
			print('<')
			flag = 1
			break
		i += 1
	if flag == 0:
		print('=')


import sys
a = sys.stdin.readline()
b = sys.stdin.readline()
if len(a) < len(b):
	a = '0' * (len(b) - len(a)) + a
elif len(b) < len(a):
	b = '0' * (len(a) - len(b)) + b
if a == b:
	sys.stdout.write('=')
elif a < b:
	sys.stdout.write('<')
elif b < a:
	sys.stdout.write('>')


a = input()
b = input()
index = None
for i in range(len(a)):
	if a[i] == '0' and i != len(a) - 1:
		index = i
		continue
	break
if index != None:
	a = a[index + 1:]
index = None
for i in range(len(b)):
	if b[i] == '0' and i != len(b) - 1:
		index = i
		continue
	break
if index != None:
	b = b[index + 1:]
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	for i in range(len(a)):
		if int(a[i]) > int(b[i]):
			print('>')
			quit()
		elif int(a[i]) < int(b[i]):
			print('<')
			quit()
	print('=')


a = input()
b = input()
(lena, lenb) = (len(a), len(b))
if lena > lenb:
	b = '0' * (lena - lenb) + b
elif lenb > lena:
	a = '0' * (lenb - lena) + a
equal = True
i = 0
while equal and i < len(a):
	ai = int(a[i])
	bi = int(b[i])
	if ai != bi:
		if ai > bi:
			print('>')
			equal = False
		else:
			print('<')
			equal = False
	i += 1
if equal:
	print('=')


a = input()
b = input()
if a.count('0') != len(a):
	a = a.lstrip('0')
if a.count('0') == len(a):
	a = '0'
if b.count('0') != len(b):
	b = b.lstrip('0')
if b.count('0') == len(b):
	b = '0'

def compare(a, b):
	if len(a) > len(b):
		return '>'
	if len(a) < len(b):
		return '<'
	if len(a) == len(b):
		for i in range(0, len(a)):
			if a[i] > b[i]:
				return '>'
			if a[i] < b[i]:
				return '<'
		if a[-1] == b[-1]:
			return '='
print(compare(a, b))


__author__ = 'ramanbirulia'

def count_zeroes(*args):
	for i in range(len(args)):
		j = 0
		la = len(args[i])
		while args[i][j] == '0' and j + 1 < la:
			j += 1
			zeros[i] += 1

def compare(n1, n2):
	i = 0
	l1 = len(n1)
	l2 = len(n2)
	if l1 == l2:
		for i in range(l1):
			if n1[i] > n2[i]:
				return '>'
			elif n1[i] < n2[i]:
				return '<'
	elif l1 > l2:
		return '>'
	else:
		return '<'
	return '='
zeros = [0, 0]
number1 = input()
number2 = input()
count_zeroes(number1, number2)
number1 = number1[zeros[0]:] or '0'
number2 = number2[zeros[1]:] or '0'
print(compare(number1, number2))


import sys
import math
a = input()
ind = 0
while ind < len(a) and a[ind] == '0':
	ind += 1
a = a[ind:]
b = input()
ind = 0
while ind < len(b) and b[ind] == '0':
	ind += 1
b = b[ind:]
if len(a) < len(b):
	print('<')
elif len(b) < len(a):
	print('>')
elif a < b:
	print('<')
elif a == b:
	print('=')
else:
	print('>')


s1 = list(input())
s2 = list(input())

def fnz(s):
	for _ in range(len(s)):
		if s[_] != '0':
			return _
	return -1
i1 = fnz(s1)
i2 = fnz(s2)
if i1 == i2 == -1:
	print('=')
	exit()
elif i1 == -1:
	print('<')
	exit()
elif i2 == -1:
	print('>')
	exit()
r1 = len(s1) - i1
r2 = len(s2) - i2
if r1 > r2:
	print('>')
	exit()
elif r1 < r2:
	print('<')
	exit()
t1 = s1[i1:]
t2 = s2[i2:]
for i in range(r1):
	if t1[i] > t2[i]:
		print('>')
		exit()
	elif t1[i] < t2[i]:
		print('<')
		exit()
print('=')


def solve(a, b):
	(i, j, la, lb) = (0, 0, len(a), len(b))
	while i < la and a[i] == '0':
		i += 1
	while j < lb and b[j] == '0':
		j += 1
	if la - i > lb - j:
		print('>')
		return
	if la - i < lb - j:
		print('<')
		return
	for k in range(la - i):
		if a[i + k] < b[j + k]:
			print('<')
			return
		if a[i + k] > b[j + k]:
			print('>')
			return
	print('=')
(a, b) = (input(), input())
solve(a, b)


a = input()
b = input()
m = len(a)
n = len(b)
x = '0' * abs(m - n)
if m < n:
	a = x + a
else:
	b = x + b
flag = 1
for i in range(max(m, n)):
	if a[i] > b[i]:
		print('>')
		flag = 0
		break
	if b[i] > a[i]:
		print('<')
		flag = 0
		break
if flag:
	print('=')


a = input()
b = input()
l = max(len(a), len(b))
da = len(a) - l
db = len(b) - l
for i in range(l):
	start_a = '0'
	if da + i >= 0:
		start_a = a[da + i]
	start_b = '0'
	if db + i >= 0:
		start_b = b[db + i]
	if start_a < start_b:
		print('<')
		exit(0)
	elif start_a > start_b:
		print('>')
		exit(0)
print('=')


a = input()
b = input()
ia = 0
while ia < len(a) and a[ia] == '0':
	ia += 1
a = a[ia:]
ib = 0
while ib < len(b) and b[ib] == '0':
	ib += 1
b = b[ib:]
if len(a) > len(b):
	print('>')
elif len(b) > len(a):
	print('<')
elif a > b:
	print('>')
elif a < b:
	print('<')
else:
	print('=')


import math
import sys
import re

def func(a, b):
	if len(a) > len(b):
		return '>'
	elif len(a) < len(b):
		return '<'
	else:
		for x in range(len(a)):
			if a[x] > b[x]:
				return '>'
			elif a[x] < b[x]:
				return '<'
	return '='
a = input()
b = input()
a1 = a.lstrip('0')
b1 = b.lstrip('0')
print(func(a1, b1))


s = input()
s1 = input()
if len(s) > len(s1):
	s1 = '0' * (len(s) - len(s1)) + s1
else:
	s = '0' * (len(s1) - len(s)) + s
if s > s1:
	print('>')
elif s < s1:
	print('<')
else:
	print('=')


n1 = str(input())
n2 = str(input())
n1 = n1.zfill(max([len(n1), len(n2)]))
n2 = n2.zfill(len(n1))
if n1 > n2:
	print('>')
elif n1 < n2:
	print('<')
else:
	print('=')


s = input().lstrip('0')
r = input().lstrip('0')
if s == r:
	print('=')
elif len(s) > len(r) or (len(s) == len(r) and s > r):
	print('>')
else:
	print('<')


x = input()
y = input()
if len(x) > len(y):
	y = '0' * (len(x) - len(y)) + y
elif len(y) > len(x):
	x = '0' * (len(y) - len(x)) + x
if x > y:
	print('>')
elif y > x:
	print('<')
else:
	print('=')


def main():
	a = input()
	b = input()
	x = max(len(a), len(b))
	a = '0' * (x - len(a)) + a
	b = '0' * (x - len(b)) + b
	if a > b:
		print('>')
	elif a < b:
		print('<')
	else:
		print('=')
main()


a = input()
b = input()
(i, j) = (0, 0)
if list(set(a)) == ['0'] and list(set(b)) == ['0']:
	print('=')
elif list(set(a)) == ['0']:
	print('<')
elif list(set(b)) == ['0']:
	print('>')
else:
	while True:
		if a[i] == '0':
			i += 1
		else:
			break
	n1 = len(a) - i
	while True:
		if b[j] == '0':
			j += 1
		else:
			break
	n2 = len(b) - j
	if n1 > n2:
		print('>')
	elif n1 < n2:
		print('<')
	else:
		a = a[i:]
		b = b[j:]
		for i in range(n1):
			if a[i] > b[i]:
				print('>')
				break
			elif a[i] < b[i]:
				print('<')
				break
		if a[i] == b[i]:
			print('=')


a = input().rstrip()
b = input().rstrip()
x = list(a)
y = list(b)
l = []
q = []
T = 0
F = len(x)
for i in range(0, len(x)):
	if x[i] == '0' and T == 0:
		continue
	else:
		F = i
		break
T = 0
G = len(y)
for i in range(0, len(y)):
	if y[i] == '0' and T == 0:
		continue
	else:
		G = i
		break
x = x[F:len(x)]
y = y[G:len(y)]
if len(x) > len(y):
	print('>')
elif len(x) < len(y):
	print('<')
else:
	A = 0
	for i in range(0, len(x)):
		if int(x[i]) == int(y[i]):
			A = 0
		elif int(x[i]) > int(y[i]):
			A = 1
			break
		elif int(x[i]) < int(y[i]):
			A = 2
			break
	if A == 0:
		print('=')
	elif A == 1:
		print('>')
	else:
		print('<')


answerOne = input().lstrip('0')
answerTwo = input().lstrip('0')
if len(answerOne) != len(answerTwo):
	print('>' if len(answerOne) > len(answerTwo) else '<')
else:
	print('>' if answerOne > answerTwo else '<' if answerTwo > answerOne else '=')


from collections import deque
sp_inpdq = deque()

def sp_inp():
	while len(sp_inpdq) == 0:
		sp_inpdq.extend(input().split())
	return sp_inpdq.popleft()
(a, b) = (sp_inp().rjust(10 ** 6, '0'), sp_inp().rjust(10 ** 6, '0'))
print('{}'.format('>' if a > b else '<' if a < b else '='))


def form(s):
	for i in range(len(s)):
		if s[i] != '0':
			return s[i:]
	return '0'

def cmp(a, b):
	a = form(a)
	b = form(b)
	if a == b:
		return '='
	elif len(a) > len(b):
		return '>'
	elif len(a) < len(b):
		return '<'
	for i in range(len(a)):
		if a[i] > b[i]:
			return '>'
		elif a[i] < b[i]:
			return '<'
print(cmp(input(), input()))


from sys import stdin, stdout

def ii():
	return int(stdin.readline())

def mi():
	return map(int, stdin.readline().split())

def li():
	return list(mi())

def si():
	return stdin.readline()
s1 = si().rjust(10 ** 6 + 1, '0')
s2 = si().rjust(10 ** 6 + 1, '0')
if s1 > s2:
	print('>')
elif s1 < s2:
	print('<')
else:
	print('=')


(a, b) = [input().lstrip('0') for _ in range(2)]
if len(a) != len(b):
	print('>' if len(a) > len(b) else '<')
else:
	print('>' if a > b else '<' if a < b else '=')


from sys import stdin
a = stdin.readline()
b = stdin.readline()
if len(a) > len(b):
	b = (len(a) - len(b)) * '0' + b
else:
	a = (len(b) - len(a)) * '0' + a
if a > b:
	print('>')
elif b > a:
	print('<')
else:
	print('=')


import sys
a = sys.stdin.buffer.readline().decode('utf-8').rstrip()
b = sys.stdin.buffer.readline().decode('utf-8').rstrip()
(n, m) = (len(a), len(b))
(i, j) = (0, 0)
while i < n and a[i] == '0':
	i += 1
while j < m and b[j] == '0':
	j += 1
if n - i != m - j:
	print('<' if n - i < m - j else '>')
	exit()
while i < n:
	if a[i] < b[j]:
		print('<')
		break
	if a[i] > b[j]:
		print('>')
		break
	i += 1
	j += 1
else:
	print('=')


(s, y) = (input(), input())
if len(s) > len(y):
	y = y.zfill(len(s))
else:
	s = s.zfill(len(y))
if s == y:
	print('=')
elif s > y:
	print('>')
else:
	print('<')


(s1, s2) = (input(), input())
(index1, index2) = (0, 0)
for (i, j) in enumerate(s1):
	if j is not '0':
		break
	else:
		index1 += 1
for (i, j) in enumerate(s2):
	if j is not '0':
		break
	else:
		index2 += 1
s1 = s1[index1:]
s2 = s2[index2:]
if len(s1) > len(s2):
	print('>')
elif len(s1) < len(s2):
	print('<')
else:
	for i in zip(s1, s2):
		if i[0] > i[1]:
			print('>')
			quit()
		elif i[0] < i[1]:
			print('<')
			quit()
	print('=')


a = str(input())
b = str(input())
(la, lb) = (len(a), len(b))
if la > lb:
	b = '0' * (la - lb) + b
elif la < lb:
	a = '0' * (lb - la) + a
if a > b:
	print('>')
elif a < b:
	print('<')
else:
	print('=')


(a, b) = (input(), input())
m = max(len(a), len(b))
(a, b) = (a.zfill(m), b.zfill(m))
print('>' if a > b else '<' if a < b else '=')


from sys import stdin, stdout
a = input()
b = input()
if len(b) < len(a):
	b = '0' * (len(a) - len(b)) + b
else:
	a = '0' * (len(b) - len(a)) + a
if a < b:
	print('<')
elif a > b:
	print('>')
else:
	print('=')


import sys
a = sys.stdin.readline().strip()
b = sys.stdin.readline().strip()
acnt = 0
bcnt = 0
for data in a:
	if data == '0':
		acnt = acnt + 1
	else:
		break
for data in b:
	if data == '0':
		bcnt = bcnt + 1
	else:
		break
a = a[acnt:]
b = b[bcnt:]
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
elif a < b:
	print('<')
elif a > b:
	print('>')
else:
	print('=')


A = input()
B = input()
a = min((A.find(str(i)) % len(A) for i in range(1, 10)))
b = min((B.find(str(i)) % len(B) for i in range(1, 10)))
(A, B) = (A[a:], B[b:])
if len(A) < len(B):
	print('<')
elif len(A) > len(B):
	print('>')
else:
	for i in range(len(A)):
		if ord(A[i]) < ord(B[i]):
			print('<')
			break
		elif ord(A[i]) > ord(B[i]):
			print('>')
			break
	else:
		print('=')


a = input()
b = input()
swap = 0
ans = ['<', '>']
if len(a) > len(b):
	(a, b) = (b, a)
	swap = 1
a = '0' * (len(b) - len(a)) + a
if a == b:
	print('=')
	quit()
if a < b:
	print(ans[swap])
	quit()
print(ans[1 - swap])


import re

def solve(a, b):
	a_first_digit = re.search('[1-9]', a)
	b_first_digit = re.search('[1-9]', b)
	if a_first_digit is None and b_first_digit is not None:
		return '<'
	if b_first_digit is None and a_first_digit is not None:
		return '>'
	if a_first_digit is None and b_first_digit is None:
		return '='
	a_first_digit = a_first_digit.start()
	b_first_digit = b_first_digit.start()
	a_length = len(a) - a_first_digit
	b_length = len(b) - b_first_digit
	if a_length < b_length:
		return '<'
	if a_length > b_length:
		return '>'
	for i in range(a_length):
		if a[a_first_digit + i] < b[b_first_digit + i]:
			return '<'
		if a[a_first_digit + i] > b[b_first_digit + i]:
			return '>'
	return '='
a = input()
b = input()
print(solve(a, b))


from itertools import chain, repeat

def main():
	(sa, sb, inv) = (input(), input(), False)
	(la, lb) = (len(sa), len(sb))
	if la < lb:
		(sa, sb, la, lb, inv) = (sb, sa, lb, la, True)
	for (a, b) in zip(sa, chain(repeat('0', la - lb), sb)):
		if a != b:
			print('<>'[inv ^ (a > b)])
			return
	print('=')
main()


a = str(input())
b = str(input())
tot = max(len(a), len(b))
a = a.rjust(tot, '0')
b = b.rjust(tot, '0')
if a > b:
	print('>')
elif a < b:
	print('<')
else:
	print('=')


A = input().lstrip('0')
B = input().lstrip('0')
if len(A) > len(B):
	print('>')
elif len(A) < len(B):
	print('<')
else:
	for i in range(len(A)):
		if A[i] > B[i]:
			print('>')
			break
		elif A[i] < B[i]:
			print('<')
			break
	else:
		print('=')


a = input()
b = input()

def strip_zeros(n):
	leading_zeros = 0
	for i in range(len(n) - 1):
		if n[i] == '0':
			leading_zeros += 1
		else:
			break
	return n[leading_zeros:]
a = strip_zeros(a)
b = strip_zeros(b)
if len(a) > len(b):
	print('>')
elif len(a) < len(b):
	print('<')
else:
	equal = True
	for i in range(len(a)):
		if a[i] > b[i]:
			equal = False
			print('>')
			break
		elif a[i] < b[i]:
			equal = False
			print('<')
			break
	if equal:
		print('=')


(num1, num2) = (input(), input())
num11 = '0' * len(num2) + num1
num21 = '0' * len(num1) + num2
if num11 > num21:
	print('>')
elif num11 < num21:
	print('<')
else:
	print('=')