바이준 비단뱀 1330, 1550, 2741, 2742, 2752, 4101, 4562, 4892, 5217, 5337, 5338, 5339, 5522, 6749

A,B=map(int,input().split())

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

number = int(input(),16)
print(number)

number = int(input())

for i in range(1, number+1):
    print(i)

#2742

number = int(input())

while(number >= 1):
    print(number)
    number-=1

#2752

number = map(int,input().split())
num = sorted(number)
print(*num)

A,B = map(int,input().split())

while (A!
=0 and B!
=0):

    if(A>B):
        print("Yes")
    else:
        print("No")
    A,B = map(int,input().split())

num = int(input())

for i in range(num):
    A,B = map(int,input().split())
    if (A>=B):
        print("MMM BRAINS")
    else: print("NO BRAINS")

n0 = int(input())

i=1

while(n0 !
= 0):
    n1 =3*n0
    if (n1 % 2 == 0):
        n4 = n0 // 2
        print("%d. even %d"%(i,n4))
    else:
        n4 = (n0 - 1) // 2
        print("%d. odd %d"%(i,n4))
    i+=1
    n0 = int(input())

num = int(input())

for i in range(num):
    A = int(input())
    print("Pairs for %d: " %A,end='')

    for k in range(1,(((A-1)//2)+1)):
        if k!
=1:
            print(',',end=' ')
        print(k,A-k,end='')
        k+=1
    print()

""" 
1:0
2:0
3: 1 2 1번
4: 1 3 , 3 1 2번 -> 1번
5: 1 4 , 2 3 , 3 2, 4 1 4번 -> 2번
6: 1 5, 2 4, 3 3, 4 2, 5 1 5번 -> 2번
n: ((n-1)//2)개의 순서쌍 도출 
"""

print(".  .   .")
print("|  | _ | _. _ ._ _  _")
print("|/\|(/.|(_.(_)( | )(/.")

print("       _.-;;-._")
print("'-..-'|   ||   |")
print("'-..-'|_.-;;-._|")
print("'-..-'|   ||   |")
print("'-..-'|_.-''-._|")

print("     /~\ ")
print("    ( oo|")
print("    _\=/_")
print("   /  _  \ ")
print("  //|/.\|\\\ ")
print(" ||  \ /  ||")
print("============")
for i in range(3):
    print("|          |")

sum=0

for i in range(5):
    score = int(input())
    sum += score

print(sum)

손님 #6749

n2 = int(input())
n3 = int(input())

sub = n3-n2
n1 = n3 + sub
print(n1)