TnT/CodeNet4Repair huggingface dataset:
Problem:
A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.  Write a program which reads a list of _N_ integers and prints the number of prime numbers in the list.

Incorrect submission (verdict: Wrong Answer):
def is_prime(x):
    if x == 2:
        return True
    if x < 2:
        return False
    for i in range(3, int(x ** .5) + 1, 2):
        if x % i == 0:
            return False
    return True
n = int(input())
print(sum(is_prime(int(input())) for _ in range(n)))


Fixed, accepted submission:
def is_prime(x):
    if x == 2:
        return True
    if x < 2 or x % 2 == 0:
        return False
    for i in range(3, int(x ** .5) + 1, 2):
        if x % i == 0:
            return False
    return True
n = int(input())
print(sum(is_prime(int(input())) for _ in range(n)))
Problem:
Two children are playing tag on a number line. (In the game of tag, the child called "it" tries to catch the other child.) The child who is "it" is now at coordinate A, and he can travel the distance of V per second. The other child is now at coordinate B, and she can travel the distance of W per second.  He can catch her when his coordinate is the same as hers. Determine whether he can catch her within T seconds (including exactly T seconds later). We assume that both children move optimally.

Incorrect submission (verdict: Wrong Answer):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if (b-a) < t*(w-v):
  print('YES')
else:
  print('NO')

Fixed, accepted submission:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if abs(a-b) <= t*(v-w):
  print('YES')
else:
  print('NO')
Problem:
You have A 500-yen coins, B 100-yen coins and C 50-yen coins (yen is the currency of Japan). In how many ways can we select some of these coins so that they are X yen in total?  Coins of the same kind cannot be distinguished. Two ways to select coins are distinguished when, for some kind of coin, the numbers of that coin are different.

Incorrect submission (verdict: Wrong Answer):
A = 30
B = 40
C = 50
X = 6000

A_list = [500*i for i in range(A+1)]
B_list = [100*i for i in range(B+1)]
C_list = [50*i for i in range(C+1)]
sum_list = []

for i in A_list:
    for j in B_list:
        i_j = i + j
        for k in C_list:
            sum_list.append(i_j + k)

result = 0
for i in sum_list:
    if i == X:
        result += 1

print(result)

Fixed, accepted submission:
A = int(input())
B = int(input())
C = int(input())
X = int(input())

result = 0

for i in range(A+1):
    for j in range(B+1):
        i_j = 500*i + 100*j
        for k in range(C+1):
            if i_j + 50*k == X:
                result += 1

print(result)
Problem:
You are given two positive integers a and b. Let x be the average of a and b. Print x rounded up to the nearest integer.

Incorrect submission (verdict: Wrong Answer):
def solve():
    a, b = map(int, input().split())

    x = ((a + b) // 2) + 1
    print(x)
solve()


Fixed, accepted submission:
from math import ceil
def solve():
    a, b = map(int, input().split())
    print(ceil((a + b) / 2))
solve()
Problem:
You are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.    An example of a trapezoid  Find the area of this trapezoid.

Incorrect submission (verdict: Wrong Answer):
a = int(input())
b = int(input())
h = int(input())

if a>b:
  print((((a-b)*h)/2)+(b*h))
elif b>a:
  print((((b-a)*h)/2)+(a*h))
else:
  print(a*h)

Fixed, accepted submission:
a = int(input())
b = int(input())
h = int(input())

if a>b:
  print(int((((a-b)*h)/2)+(b*h)))
elif b>a:
  print(int((((b-a)*h)/2)+(a*h)))
else:
  print(int(a*h))
Problem:
You are given a grid with 2 rows and 3 columns of squares. The color of the square at the i-th row and j-th column is represented by the character C_{ij}.  Write a program that prints `YES` if this grid remains the same when rotated 180 degrees, and prints `NO` otherwise.

Incorrect submission (verdict: Wrong Answer):
a=input()
b=input()
c=b[::-1]
if a == c[::-1]:
  print("YES")
else:
  print("NO")

Fixed, accepted submission:
a=input()
b=input()
c=b[::-1]
if a == c:
  print("YES")
else:
  print("NO")
Problem:
You are given a string S consisting of lowercase English letters. Another string T is initially empty. Determine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:    * Append one of the following at the end of T: `dream`, `dreamer`, `erase` and `eraser`.

Incorrect submission (verdict: Wrong Answer):
S = input()
strs = ["dream","dreamer","erase","eraser"]
ind = 0
while True:
    # print(ind,S[ind])
    if S[ind] == "e":
        if S[ind:ind+5] == "erase":
            if ind+5 == len(S): 
                print("YES")
                exit()
            if S[ind+5] == "r": 
                if ind + 6 ==len(S):
                    print("YES")
                    exit()
                ind+=6 
            elif S[ind+5] == "d" or S[ind+5]=="e": 
                ind+=5 
            else:
                print("NO")
                exit()
        else:
            print("NO")
            exit()
    elif S[ind] == "d":
        if S[ind:ind+5] == "dream":
            if ind + 5 == len(S):
                print("YES")
                exit()
            if S[ind+5] == "d" :ind += 5 
            if S[ind+5] == "e":
                if S[ind+6] == "r":
                    if ind + 7 == len(S):
                        print("YES")
                        exit()
                    if S[ind+7] == "e" or S[ind+7] =="d": ind += 6 
                    elif S[ind+7] == "a": ind += 5 
                else:
                    print("NO")
                    exit()
        else:
            print("NO")
            exit()
    else:
        print("NO")
        exit()
    print(ind)

Fixed, accepted submission:
S = input()
strs = ["erase", "eraser", "dreamer","dream"]
rtss = [s[::-1] for s in strs]
S = S[::-1]

ind = 0
while True:
    # print(ind,S[ind])
    if S[ind:ind+5] in rtss:
        ind += 5
    elif S[ind:ind+6] in rtss:
        ind += 6
    elif S[ind:ind+7] in rtss:
        ind +=7
    else:
        print("NO")
        exit()
    if ind == len(S):
        print("YES")
        exit()
Problem:
You are given a string S of length N consisting of lowercase English letters. We will cut this string at one position into two strings X and Y. Here, we would like to maximize the number of different letters contained in both X and Y. Find the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.

Incorrect submission (verdict: Wrong Answer):
#ABC098B
n = int(input())
s = input()
ans = 0
for i in range(1,n):
    s1 = list(set(s[:i]))
    s2 = list(set(s[i:]))
    cnt = [s2.count(x) for x in s1]
    count=0
    for c in cnt:
        count+=c
    ans=max(ans,count)
print()

Fixed, accepted submission:
n=int(input())
s=input()
ans=0
for i in range(n):
    l = list(set(s[:i]))
    r = list(set(s[i:]))
    count=0
    for x in l:
        count+=r.count(x)
    if ans<count:
        ans=count
print(ans)
Problem:
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.

Incorrect submission (verdict: Wrong Answer):
a, b = input().split()

result = int(a) * int(b)

if result % 2 == 0:
  print("even")
else :
  print("odd")

Fixed, accepted submission:
a,b = input().split()
result = int(a) * int(b)
     
if result % 2 == 0:
	print("Even")
else :
	print("Odd")
Problem:
There are N balls in the xy-plane. The coordinates of the i-th of them is (x_i, i). Thus, we have one ball on each of the N lines y = 1, y = 2, ..., y = N.  In order to collect these balls, Snuke prepared 2N robots, N of type A and N of type B. Then, he placed the i-th type-A robot at coordinates (0, i), and the i-th type-B robot at coordinates (K, i). Thus, now we have one type-A robot and one type-B robot on each of the N lines y = 1, y = 2, ..., y = N.  When activated, each type of robot will operate as follows.    * When a type-A robot is activated at coordinates (0, a), it will move to the position of the ball on the line y = a, collect the ball, move back to its original position (0, a) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.    * When a type-B robot is activated at coordinates (K, b), it will move to the position of the ball on the line y = b, collect the ball, move back to its original position (K, b) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.  Snuke will activate some of the 2N robots to collect all of the balls. Find the minimum possible total distance covered by robots.

Incorrect submission (verdict: Wrong Answer):
N = int(input())
K = int(input())

X = list(map(int, input().split()))

res = 0
for i in range(N):
  if X[i] >= (K - X[i]):
    res += 2 * X[i]
  else:
    res += 2 * (K - X[i])

print(res)

Fixed, accepted submission:
N = int(input())
K = int(input())

X = list(map(int, input().split()))

res = 0
for i in range(N):
  if X[i] <= (K - X[i]):
    res += 2 * X[i]
  else:
    res += 2 * (K - X[i])

print(res)
Problem:
E869120 has A 1-yen coins and infinitely many 500-yen coins.   Determine if he can pay exactly N yen using only these coins.

Incorrect submission (verdict: Wrong Answer):
N = int(input())
a = list(map(int, input().split()))
 
a.sort(reverse=True)
 
print(sum(a[::2])-sum(a[1::2]))

Fixed, accepted submission:
n = int(input())
a = int(input())
if n%500 <= a:
  print("Yes")
else:
  print("No")
Problem:
You are given two positive integers a and b. Let x be the average of a and b. Print x rounded up to the nearest integer.

Incorrect submission (verdict: Wrong Answer):
a, b = map(int, input().split())
x = a + b
if x % 2 == 0:
  print(x/2)
else:
  print((x + 1)/2)

Fixed, accepted submission:
a, b = map(int, input().split())
x = a + b
if x % 2 == 0:
  print(int(x/2))
else:
  print(int((x + 1)/2))
Problem:
You are given a string S consisting of lowercase English letters. Another string T is initially empty. Determine whether it is possible to obtain S = T by performing the following operation an arbitrary number of times:    * Append one of the following at the end of T: `dream`, `dreamer`, `erase` and `eraser`.

Incorrect submission (verdict: Wrong Answer):
s = input()
 
ans = 'YES'
 
while len(s) > 0:
    if s.endswith('dreamer'):
        s = s[:-7]
    elif s.endswith('dream'):
        s = s[:-5]
    elif s.endswith('eraser'):
        s = s[:-6]
    elif s.endswith('erase'):
        s = s[:-5]
    else:
        ans = 'NO'

Fixed, accepted submission:
s = input()
 
ans = 'YES'
 
while len(s) > 0:
    if s.endswith('dreamer'):
        s = s[:-7]
    elif s.endswith('dream'):
        s = s[:-5]
    elif s.endswith('eraser'):
        s = s[:-6]
    elif s.endswith('erase'):
        s = s[:-5]
    else:
        ans = 'NO'
        break
 
print(ans)
Problem:
Snuke and Raccoon have a heap of N cards. The i-th card from the top has the integer a_i written on it.  They will share these cards. First, Snuke will take some number of cards from the top of the heap, then Raccoon will take all the remaining cards. Here, both Snuke and Raccoon have to take at least one card.  Let the sum of the integers on Snuke's cards and Raccoon's cards be x and y, respectively. They would like to minimize |x-y|. Find the minimum possible value of |x-y|.

Incorrect submission (verdict: Wrong Answer):
N = int(input())
A = list(map(int,input().split()))
S1 = A[0]
S2 = sum(A)-A[0]
B = [S1-S2]

for i in range(N-2):
  S1 += A[i+1]
  S2 -= A[i+1]
  B.append(abs(S1-S2))

print(min(B))

Fixed, accepted submission:
N = int(input())
A = list(map(int,input().split()))
S1 = A[0]
S2 = sum(A)-A[0]
B = [abs(S1-S2)]

for i in range(N-2):
  S1 += A[i+1]
  S2 -= A[i+1]
  B.append(abs(S1-S2))

print(min(B))
Problem:
Sitting in a station waiting room, Joisino is gazing at her train ticket.  The ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).  In the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with `+` or `-` so that the formula holds.  The given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.

Incorrect submission (verdict: Wrong Answer):
n = list(map(int,input()))

if n[0] + n[1] + n[2] + n[3] == 7:
    print("{}+{}+{}+{}".format(n[0],n[1],n[2],n[3]))
elif n[0] + n[1] + n[2] - n[3] == 7:
    print("{}+{}+{}+{}".format(n[0],n[1],n[2],n[3]))
elif n[0] + n[1] - n[2] + n[3] == 7:
    print("{}+{}+{}+{}".format(n[0],n[1],n[2],n[3]))
elif n[0] + n[1] - n[2] - n[3] == 7:
    print("{}+{}+{}+{}".format(n[0],n[1],n[2],n[3]))
elif n[0] - n[1] + n[2] + n[3] == 7:
    print("{}+{}+{}+{}".format(n[0],n[1],n[2],n[3]))
elif n[0] - n[1] + n[2] - n[3] == 7:
    print("{}+{}+{}+{}".format(n[0],n[1],n[2],n[3]))
elif n[0] - n[1] - n[2] + n[3] == 7:
    print("{}+{}+{}+{}".format(n[0],n[1],n[2],n[3]))
elif n[0] - n[1] - n[2] - n[3] == 7:
    print("{}+{}+{}+{}".format(n[0],n[1],n[2],n[3]))
else:
    print("error")


Fixed, accepted submission:
n = list(map(int,input()))

if n[0] + n[1] + n[2] + n[3] == 7:
    print("{}+{}+{}+{}=7".format(n[0],n[1],n[2],n[3]))
elif n[0] + n[1] + n[2] - n[3] == 7:
    print("{}+{}+{}-{}=7".format(n[0],n[1],n[2],n[3]))
elif n[0] + n[1] - n[2] + n[3] == 7:
    print("{}+{}-{}+{}=7".format(n[0],n[1],n[2],n[3]))
elif n[0] + n[1] - n[2] - n[3] == 7:
    print("{}+{}-{}-{}=7".format(n[0],n[1],n[2],n[3]))
elif n[0] - n[1] + n[2] + n[3] == 7:
    print("{}-{}+{}+{}=7".format(n[0],n[1],n[2],n[3]))
elif n[0] - n[1] + n[2] - n[3] == 7:
    print("{}-{}+{}-{}=7".format(n[0],n[1],n[2],n[3]))
elif n[0] - n[1] - n[2] + n[3] == 7:
    print("{}-{}-{}+{}=7".format(n[0],n[1],n[2],n[3]))
elif n[0] - n[1] - n[2] - n[3] == 7:
    print("{}-{}-{}-{}=7".format(n[0],n[1],n[2],n[3]))
else:
    print("error")
Problem:
We will buy a product for N yen (the currency of Japan) at a shop.  If we use only 1000-yen bills to pay the price, how much change will we receive?  Assume we use the minimum number of bills required.

Incorrect submission (verdict: Wrong Answer):
N = int(input())
print(N%1000)
  

Fixed, accepted submission:
N = int(input())
if N%1000 == 0:
  print(0)
else:
  while N>=1000:
    N-=1000
  print(abs(N-1000))
Problem:
In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, you can implement, for example, loops.  Note that use of goto statement is highly discouraged, because it is difficult to trace the control flow of a program which includes goto.  Write a program which does precisely the same thing as the following program (this example is wrtten in C++). Let's try to write the program without goto statements.                 void call(int n){   int i = 1;  CHECK_NUM:   int x = i;   if ( x % 3 == 0 ){     cout << " " << i;     goto END_CHECK_NUM;   }  INCLUDE3:   if ( x % 10 == 3 ){     cout << " " << i;     goto END_CHECK_NUM;   }   x /= 10;   if ( x ) goto INCLUDE3;  END_CHECK_NUM:   if ( ++i <= n ) goto CHECK_NUM;    cout << endl; }

Incorrect submission (verdict: Wrong Answer):
n = int(input())

for i in range(3, n + 1):
    if i % 3 == 0:
        print(i)
    elif '3' in list(str(i)):
        print(i)

Fixed, accepted submission:
n = int(input())
result = ['']

for i in range(3, n + 1):
    if i % 3 == 0:
        result.append(i)
    elif '3' in list(str(i)):
        result.append(i)

print(*result)
Problem:
There are N positive integers written on a blackboard: A_1, ..., A_N.  Snuke can perform the following operation when all integers on the blackboard are even:    * Replace each integer X on the blackboard by X divided by 2.  Find the maximum possible number of operations that Snuke can perform.

Incorrect submission (verdict: Wrong Answer):
arr =  [int(i) for i in input().split()] 

count = 0
while(True):
    for i, j in enumerate(arr):
        if j % 2 == 0:
            arr[i] = j / 2
            if i == 2:
                count += 1
        else:
            break
    else:
        continue
    break
        
        

print(count)



Fixed, accepted submission:
import numpy as np
N = int(input())
arr =  np.array([int(i) for i in input().split()])

count = 0
while(True):
    exits_odd = False
    for i in range(N):
        if arr[i] % 2 != 0:
            exits_odd = True
        else:
            continue
    if exits_odd:
        break
    else:
        count += 1
        arr = arr / 2


print(count)
Problem:
Snuke has decided to construct a string that starts with `A` and ends with `Z`, by taking out a substring of a string s (that is, a consecutive part of s).  Find the greatest length of the string Snuke can construct. Here, the test set guarantees that there always exists a substring of s that starts with `A` and ends with `Z`.

Incorrect submission (verdict: Wrong Answer):
A = input()
N = len(A)
print(A)
for i in range(N):
    if A[i] == 'A':
        S = i
        break
for i in range(N):
    if A[N-i-1] == 'Z':
        E = i
        break
print(N - S - E)


Fixed, accepted submission:
A = input()
N = len(A)
#print(A)
for i in range(N):
    if A[i] == 'A':
        S = i
        break
for i in range(N):
    if A[N-i-1] == 'Z':
        E = i
        break
print(N - S - E)
Problem:
There are N positive integers written on a blackboard: A_1, ..., A_N.  Snuke can perform the following operation when all integers on the blackboard are even:    * Replace each integer X on the blackboard by X divided by 2.  Find the maximum possible number of operations that Snuke can perform.

Incorrect submission (verdict: Wrong Answer):
_ = input()
num_list = input().split(" ")
num_list = list(map(lambda x:int(x), num_list))
min_num = min(num_list)

shift_counter = 0

while(True):
  if min_num == 1:
    break
  
  min_num /= 2
  shift_counter += 1

print(shift_counter)

Fixed, accepted submission:
_ = input()
num_list = input().split(" ")
num_list = list(map(lambda x:int(x), num_list))
shift_counter = 0

def checker(num_list):
  for n in num_list:
    if n % 2 != 0:
      return True
  return False

while(True):
  if checker(num_list):
    print(shift_counter)
    break
  else:
    num_list = [int(n/2) for n in num_list]
    shift_counter += 1
Problem:
Snuke built an online judge to hold a programming contest.  When a program is submitted to the judge, the judge returns a verdict, which is a two-character string that appears in the string S as a contiguous substring. (The judge can return any two-character substring of S.)  Determine whether the judge can return the string `AC` as the verdict to a program.

Incorrect submission (verdict: Wrong Answer):
print("AC" in input())

Fixed, accepted submission:
answer = "AC" in input()
if answer == False:
    print("No")
else:
    print("Yes")
Problem:
Niwango created a playlist of N songs. The title and the duration of the i-th song are s_i and t_i seconds, respectively. It is guaranteed that s_1,\ldots,s_N are all distinct.  Niwango was doing some work while playing this playlist. (That is, all the songs were played once, in the order they appear in the playlist, without any pause in between.) However, he fell asleep during his work, and he woke up after all the songs were played. According to his record, it turned out that he fell asleep at the very end of the song titled X.  Find the duration of time when some song was played while Niwango was asleep.

Incorrect submission (verdict: Wrong Answer):
N = int(input().rstrip())
src = [list(input().split()) for _ in range(N)]
for row in src:
    row[1] = int(row[1])
X = input()

ans = 0
for row in src:
    if row[0] == X:
      break
    else:
      ans += row[1]
print(ans)

Fixed, accepted submission:
N = int(input().rstrip())
src = [list(input().split()) for _ in range(N)]
for row in src:
    row[1] = int(row[1])
X = input()

total = 0
for row in src:
  total += row[1]

awake = 0
for row in src:
    if row[0] != X:
      awake += row[1]
    else:
      awake += row[1]
      break
ans = total - awake
print(ans)
Problem:
Takahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.  The bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)  Assuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?

Incorrect submission (verdict: Wrong Answer):
X=int(input())
i=1
Y=100
while True:
    Z=Y+0.01
    if Z>=X:
        print(i)
        break
    else:
        i=i+1
        Y=Z

Fixed, accepted submission:
X=int(input())
i=0
Y=100
while True:
    Z=int(Y*1.01)
    i=i+1
    if Z>=X:
        print(i)
        break
    else:
        Y=Z
Problem:
We will buy a product for N yen (the currency of Japan) at a shop.  If we use only 1000-yen bills to pay the price, how much change will we receive?  Assume we use the minimum number of bills required.

Incorrect submission (verdict: Wrong Answer):
import numpy as np

N = int(input())

print(N%1000)


Fixed, accepted submission:
import numpy as np

N = int(input())

for i in range(10000):
    if ( N <= 1000*i ):
        print(1000*i - N)
        break
Problem:
You are given a string S of length 3 consisting of `a`, `b` and `c`. Determine if S can be obtained by permuting `abc`.

Incorrect submission (verdict: Wrong Answer):
import sys

input = sys.stdin.readline


def main():
    s = input()
    if "a" in s and "b" in s and "c" in s:
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    main()


Fixed, accepted submission:
import sys

input = sys.stdin.readline


def main():
    s = input()
    if "a" in s and "b" in s and "c" in s:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()
Problem:
Dolphin resides in two-dimensional Cartesian plane, with the positive x-axis pointing right and the positive y-axis pointing up.   Currently, he is located at the point (sx,sy). In each second, he can move up, down, left or right by a distance of 1.   Here, both the x\- and y-coordinates before and after each movement must be integers.   He will first visit the point (tx,ty) where sx < tx and sy < ty, then go back to the point (sx,sy), then visit the point (tx,ty) again, and lastly go back to the point (sx,sy).   Here, during the whole travel, he is not allowed to pass through the same point more than once, except the points (sx,sy) and (tx,ty).   Under this condition, find a shortest path for him.

Incorrect submission (verdict: Wrong Answer):
sx,sy,tx,ty=map(int,input().split())
x=tx-sx
y=ty-sy
path=""
path+="U"*x+"R"*y+"D"*x+"L"*y
path+="L"+"R"*(x+1)+"U"*(y+1)+"L"+"U"+"L"*(x+1)+"D"*(y+1)+"R"
print(path)

Fixed, accepted submission:
sx,sy,tx,ty=map(int,input().split())
y=tx-sx
x=ty-sy
path=""
path+="U"*x+"R"*y+"D"*x+"L"*y
path+="L"+"U"*(x+1)+"R"*(y+1)+"D"+"R"+"D"*(x+1)+"L"*(y+1)+"U"
print(path)
Problem:
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?

Incorrect submission (verdict: Wrong Answer):
X, Y = input().split()
print(max(X,Y))

Fixed, accepted submission:
X, Y = input().split()
if X > Y:
  print(">")
elif X < Y:
  print("<")
else:
  print("=")