Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
S = input()
print("Heisei" if S<=2019/4/30 else "TBD")

Fixed submission:
S = input()
print("Heisei" if S <= "2019/04/30" else "TBD")
Buggy python submission (verdict: Runtime Error):
N = int(input())
list = list(map(int, input().split()))
print("Yes" if (max(list))<((sum(list))-(max(list))) else "No"))

Fixed submission:
N = int(input())
list = list(map(int, input().split()))
print("Yes" if 2*max(list) < sum(list) else "No")

Buggy python submission (verdict: Runtime Error):
N = int(input())
list = list(map(int, input().split()))
print("Yes" if max(list) < (sum(list))-(max(list)) else "No"))

Fixed submission:
N = int(input())
list = list(map(int, input().split()))
print("Yes" if 2*max(list) < sum(list) else "No")

Buggy python submission (verdict: Runtime Error):
N = int(input())
list = list(map(int, input().split()))
print("Yes" if max(list)*2 < sum(list) else "No"))

Fixed submission:
N = int(input())
list = list(map(int, input().split()))
print("Yes" if 2*max(list) < sum(list) else "No")

Buggy python submission (verdict: Runtime Error):
N = int(input())
list = list(map(int, input().split()))
print("Yes" if max(list) < sum(list) - max(list) else "No"))

Fixed submission:
N = int(input())
list = list(map(int, input().split()))
print("Yes" if 2*max(list) < sum(list) else "No")
Buggy python submission (verdict: Runtime Error):
def resolve():
    s = int(input())
    ans = [s]
    count = 0
    while True:
        if ans[count]%2 == 0:
            ans.append(ans[count]//2)
        else:
            ans.append(ans[count]*3+1)
        count += 1
        for i in range(count):
            if ans[i] == ans[count]:
                print(k+1)
                exit()
resolve()

Fixed submission:
def resolve():
    s = int(input())
    ans = [s]
    count = 0
    while True:
        if ans[count]%2 == 0:
            ans.append(ans[count]/2)
        else:
            ans.append(ans[count]*3+1)
        count += 1
        for i in range(count):
            if ans[i] == ans[count]:
                print(count+1)
                exit()
resolve()

Buggy python submission (verdict: Runtime Error):
def resolve():
    s = int(input())
    ans = [s]
    count = 0
    while True:
        if ans[count]%2 == 0:
            ans.append(ans[count]/2)
        else:
            ans.append(ans[count]*3+1)
        count += 1
        for i in range(count):
            if ans[i] == ans[count]:
                print(k+1)
                exit()
resolve()

Fixed submission:
def resolve():
    s = int(input())
    ans = [s]
    count = 0
    while True:
        if ans[count]%2 == 0:
            ans.append(ans[count]/2)
        else:
            ans.append(ans[count]*3+1)
        count += 1
        for i in range(count):
            if ans[i] == ans[count]:
                print(count+1)
                exit()
resolve()

Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    s = int(input())
    ans = [s]
    count = 0
    while s != 4:
        if ans[count]%2 == 0:
            ans.append(ans[count]/2)
        else:
            ans.append(ans[count]+3)
        count += 1
        if ans[count] < 1:
            ans[count] = ans[count-1]
    print(count+4)
resolve()

Fixed submission:
def resolve():
    s = int(input())
    ans = [s]
    count = 0
    while True:
        if ans[count]%2 == 0:
            ans.append(ans[count]/2)
        else:
            ans.append(ans[count]*3+1)
        count += 1
        for i in range(count):
            if ans[i] == ans[count]:
                print(count+1)
                exit()
resolve()
Buggy python submission (verdict: Runtime Error):
N = int(input())
list = [int(input()) for i in range(N)]
print(sum(list)-(max(N)//2))

Fixed submission:
N = int(input())
list = [int(input()) for i in range(N)]
print(sum(list)-(max(list)//2))

Buggy python submission (verdict: Runtime Error):
N = int(input())
list = [int(input()) for i in range(N)]
print(sum(list)-(max(N)/2))

Fixed submission:
N = int(input())
list = [int(input()) for i in range(N)]
print(sum(list)-(max(list)//2))
Buggy python submission (verdict: Runtime Error):
N = int(input())
A, B = map(int, input().split())
print("Hello World" if N == 1 else A+B)

Fixed submission:
N = int(input())
if N == 1:
  print("Hello World")
else:
  A, B = [int(input()) for i in range(2)]
  print(A+B)
Buggy python submission (verdict: Time Limit Exceeded):
x1, y1, x2, y2 = map(int, input().split())
k = (x2-x1)**2+(y2-y1)**2
for i in range(-100, 101):
    for j in range(-100, 101):
        for p in range(-100, 101):
            for q in range(-100, 101):
                if (i-x2)**2+(j-y2)**2 == k and (p-x1)**2+(q-y1)**2 == k and (i-p)**2+(j-q)**2 == k:
                    print(i, j, p, q)
                    exit()

Fixed submission:
def resolve():
    x1, y1, x2, y2 = map(int, input().split())
    print(x2-y2+y1, y2+x2-x1, x1-y2+y1, y1+x2-x1)
resolve()
Buggy python submission (verdict: Runtime Error):
list = list(map(int(input().split())))
print(max(list)-min(list))

Fixed submission:
a, b, c = sorted(map(int, input().split()))
print(c-a)
Buggy python submission (verdict: Runtime Error):
#include <bits/stdc++.h>
using namespace std;

int main(){
  int N;
  int ans = 0;
  for (int i = 0; i < N; i++){
    int A;
    cin >> A;
    while (A%2 == 0){
      ans++;
      A = A/2
    }
  }
  cout << ans << endl;
}

Fixed submission:
def resolve():
    N = int(input())
    A = list(map(int, input().split()))
    ans = 0
    for i in A:
        while i%2 == 0:
            ans += 1
            i = i//2
    print(ans)
resolve()
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())
print("YES" if A+B>X else "NO")

Fixed submission:
A, B, X= map(int, input().split())
print("YES" if A<=X and A+B>=X else "NO")
Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    A, B, K = map(int, input().split())
    count = []
    for _ in range(B-A+1):
        count.append(A+_)
    if K > B-A-1:
        K = B-A+1
    for i in range(K):
        print(count[i])
    for j in range(K):
        if count[(K*-1)+j] > count[K-1]:
            print(count[(K*-1)+j])
resolve()

Fixed submission:
def resolve():
    A, B, K = map(int, input().split())
    if 2*K > B-A+1:
        for _ in range(B-A+1):
            print(A+_)
    else:
        for i in range(K):
            print(A+i)
        for j in range(K):
            print(B-K+j+1)
resolve()

Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    A, B, K = map(int, input().split())
    count = []
    ans = []
    for _ in range(B-A+1):
        count.append(A+_)
    if K > B-A-1:
        K = B-A+1
    for i in range(K):
        ans.append(count[i])
        ans.append(count[(i+1)*-1])
    an = sorted(set(ans))
    for i in range(len(an)):
        print(an[i])
resolve()

Fixed submission:
def resolve():
    A, B, K = map(int, input().split())
    if 2*K > B-A+1:
        for _ in range(B-A+1):
            print(A+_)
    else:
        for i in range(K):
            print(A+i)
        for j in range(K):
            print(B-K+j+1)
resolve()

Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    A, B, K = map(int, input().split())
    count = [A]
    ans = []
    for _ in range(1, B-A+1):
        count.append(A+_)
    if K > B-A-1:
        K = B-A+1
    for i in range(K):
        ans.append(count[i])
        if count[(i+1)*-1] > A+K-1:
            ans.append(count[(i+1)*-1])
    an = sorted(ans)
    for i in range(len(an)):
        print(an[i])
resolve()

Fixed submission:
def resolve():
    A, B, K = map(int, input().split())
    if 2*K > B-A+1:
        for _ in range(B-A+1):
            print(A+_)
    else:
        for i in range(K):
            print(A+i)
        for j in range(K):
            print(B-K+j+1)
resolve()

Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    A, B, K = map(int, input().split())
    count = [A]
    ans = []
    for _ in range(1, B-A+1):
        count.append(A+_)
    if K > B-A-1:
        K = B-A+1
    for i in range(K):
        ans.append(count[i])
        if count[(i+1)*-1] >= A+K-1:
            ans.append(count[(i+1)*-1])
    an = sorted(set(ans))
    for i in range(len(an)):
        print(an[i])
resolve()

Fixed submission:
def resolve():
    A, B, K = map(int, input().split())
    if 2*K > B-A+1:
        for _ in range(B-A+1):
            print(A+_)
    else:
        for i in range(K):
            print(A+i)
        for j in range(K):
            print(B-K+j+1)
resolve()
Buggy python submission (verdict: Runtime Error):
A, B, C, D = map(int, input().split())
print(min(A, B)+min(C, D))

Fixed submission:
A, B, C, D = [int(input()) for i in range (4)]
print(min(A, B)+min(C, D))
Buggy python submission (verdict: Runtime Error):
    M = int(input())
    print(48-M)

Fixed submission:
M = int(input())
print(48-M)
Buggy python submission (verdict: Runtime Error):
import math
a, b = map(int, input().split)
print(math.ceil(a+b)/2)

Fixed submission:
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))
Buggy python submission (verdict: Runtime Error):
s = input()
t = sorted(input())[::-1]
print("Yes" if s<t else "No")

Fixed submission:
s = sorted(input())
t = sorted(input())[::-1]
print("Yes" if s<t else "No")
Buggy python submission (verdict: Runtime Error):
N = input()
print("Yes" if N%(sum(map(int, N))) == 0 else "No")

Fixed submission:
N = input()
print("Yes" if int(N)%(sum(map(int, N))) == 0 else "No")
Buggy python submission (verdict: Runtime Error):
c1 = map(int, input().split())
c2 = map(int, input().split())
print("YES" if c1 == c2[::-1] else "NO")

Fixed submission:
c1 = input()
c2 = input()
print("YES" if c1 == c2[::-1] else "NO")

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
A, B, C = map(int, input().split())
print("YES" if a==C and b==B and c==A else "NO")

Fixed submission:
c1 = input()
c2 = input()
print("YES" if c1 == c2[::-1] else "NO")
Buggy python submission (verdict: Runtime Error):
N = int(input())
if "9" in N:
  print("Yes")
else:
  print("No")

Fixed submission:
N = input()
if "9" in N:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
count = [0]*10**5
for i in A:
    count[i-1] += 1
    count[i] += 1
    count[i+1] += 1
print(max(count))

Fixed submission:
def resolve():
    N = int(input())
    A = list(map(int, input().split()))
    count = [0] * 10 ** 5
    for i in A:
        if i > 1:
            count[i - 1] += 1
        count[i] += 1
        if i < 10**5-1:
            count[i + 1] += 1
    print(max(count))
resolve()

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(1, 10**5-2):
    if ans < A.count(i) + A.count(i+1) + A.count(i+2):
        ans = A.count(i) + A.count(i+1) + A.count(i+2)
print(ans)

Fixed submission:
def resolve():
    N = int(input())
    A = list(map(int, input().split()))
    count = [0] * 10 ** 5
    for i in A:
        if i > 1:
            count[i - 1] += 1
        count[i] += 1
        if i < 10**5-1:
            count[i + 1] += 1
    print(max(count))
resolve()

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
count = []
for i in range(1, 10**5):
    count.append(A.count(i))
ans = 0
for j in range(len(count)-2):
    if count[j] + count[j+1] + count[j+2] > ans:
        ans = count[j] + count[j+1] + count[j+2]
print(ans)

Fixed submission:
def resolve():
    N = int(input())
    A = list(map(int, input().split()))
    count = [0] * 10 ** 5
    for i in A:
        if i > 1:
            count[i - 1] += 1
        count[i] += 1
        if i < 10**5-1:
            count[i + 1] += 1
    print(max(count))
resolve()
Buggy python submission (verdict: Runtime Error):
n, m = input().split()
print((n-1)*(m-1))

Fixed submission:
n, m = map(int, input().split())
print((n-1)*(m-1))
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
N = int(input())
S = [int(input()) for _ in range(N)]
cos = [0]
for i in itertools.product([0,1], repeat=N):
  ans = 0
  for j in range(N):
    if i[j] == 1:
      ans += S[j]
  if ans%10 != 0:
    cos.append(ans)
print(max(cos))

Fixed submission:
N = int(input())
S = [int(input()) for _ in range(N)]
if sum(S)%10 != 0:
  print(sum(S))
else:
  A = sorted(S)
  for i in A:
    if (sum(S)-i)%10 != 0:
      print(sum(S)-i)
      exit()
  print(0)

Buggy python submission (verdict: Runtime Error):
import itertools
N = int(input())
S = [int(input()) for _ in range(N)]
cos = []
for i in list(itertools.product([0,1], repeat=N)):
  ans = 0
  for j in range(N):
    if i[j] == "1":
      ans += S[j]
  if ans%10 != 0:
    cos.append(ans)
print(max(cos))

Fixed submission:
N = int(input())
S = [int(input()) for _ in range(N)]
if sum(S)%10 != 0:
  print(sum(S))
else:
  A = sorted(S)
  for i in A:
    if (sum(S)-i)%10 != 0:
      print(sum(S)-i)
      exit()
  print(0)
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
print("GREATER" if A<B else "EQUAL" if A==B else "LESS")

Fixed submission:
A = int(input())
B = int(input())
print("GREATER" if A>B else "EQUAL" if A==B else "LESS")
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().slipt())
print((A+B) % 24)

Fixed submission:
A, B = map(int, input().split())
print((A+B) % 24)

Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().slipt())
print((A+B)%24)

Fixed submission:
A, B = map(int, input().split())
print((A+B) % 24)
Buggy python submission (verdict: Runtime Error):
import math
N = int(input())
print(math.factrial(N) % (10**9+7))

Fixed submission:
N = int(input())
n = N//15
print(N*800-n*200)
Buggy python submission (verdict: Runtime Error):
import math
N = int(input())
print(math.factorial(N)-math.factorial(N)/(10**9+7)*math.factorial(N))

Fixed submission:
import math
N = int(input())
print(math.factorial(N) % (10**9+7))

Buggy python submission (verdict: Runtime Error):
import math
N = int(input())
print(math.factrial(N)%(10**9+7))

Fixed submission:
import math
N = int(input())
print(math.factorial(N) % (10**9+7))
Buggy python submission (verdict: Runtime Error):
x = input()
if x<1200:
  print("ABC")
else:
  print("ARC")

Fixed submission:
x = int(input())
print("ABC" if x<1200 else "ARC")

Buggy python submission (verdict: Runtime Error):
x = input()
if x<1200:
  print("ABC")
else:
  pritn("ARC")

Fixed submission:
x = int(input())
print("ABC" if x<1200 else "ARC")
Buggy python submission (verdict: Runtime Error):
a, b, c = input.split(",")
print(a, b, c)

Fixed submission:
a, b, c = input().split(",")
print(a, b, c)
Buggy python submission (verdict: Time Limit Exceeded):
def resolve():
    K, S = map(int, input().split())
    ans = 0
    for i in range(K+1):
        for j in range(K+1):
            for p in range(K+1):
                if i+j+p == S:
                    ans += 1
    print(ans)
resolve()

Fixed submission:
def resolve():
    K, S = map(int, input().split())
    ans = 0
    for i in range(K+1):
        for j in range(K+1):
            if 0 <= S-i-j <= K:
                ans += 1
    print(ans)
resolve()
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())
print(A+C if str(B)=="+" else A-C)

Fixed submission:
A, B, C = map(str, input().split())
print(int(A)+int(C) if B=="+" else int(A)-int(C))

Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())
B = str(B)
print(ABC)

Fixed submission:
A, B, C = map(str, input().split())
print(int(A)+int(C) if B=="+" else int(A)-int(C))

Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())
b = str(B)
print(A+C if b == "+" else A-C)

Fixed submission:
A, B, C = map(str, input().split())
print(int(A)+int(C) if B=="+" else int(A)-int(C))

Buggy python submission (verdict: Runtime Error):
A, B, C = map(int, input().split())
print(A+C if B == "+" else A-C)

Fixed submission:
A, B, C = map(str, input().split())
print(int(A)+int(C) if B=="+" else int(A)-int(C))
Buggy python submission (verdict: Runtime Error):
N = int(input())
t = list(map(int, input().split()))
T = sum(t)
M = int(input())
for _ in range(M):
  p, x = map(int, input().split())
  print(T+(T[p-1]-x))

Fixed submission:
N = int(input())
t = list(map(int, input().split()))
T = sum(t)
M = int(input())
for _ in range(M):
  p, x = map(int, input().split())
  print(T-(t[p-1]-x))
Buggy python submission (verdict: Runtime Error):
def resolve():
    S = input()
    i = S.index("C")
    s = S[i+1:]
    if "C" in S and "F" in s:
        print("Yes")
    else:
        print("No")
resolve()

Fixed submission:
def resolve():
    S = input()
    c = 0
    f = 0
    C = []
    F = []
    for i in range(len(S)):
        if S[i] == "C":
            c = 1
            C.append(i)
        elif S[i] == "F":
            f = 1
            F.append(i)
    print("Yes" if c == 1 and f == 1 and min(C) < max(F) else "No")
resolve()
Buggy python submission (verdict: Runtime Error):
def dfs(i, f):
    if i == n:
        return sum(list(map(int, f.split("+"))))
    return dfs(i+1, f+s[i+1])+\
           dfs(i+1, f+"+"+s[i+1])

s = input()
n = len(s)
print(dfs(0, s[0]))

Fixed submission:
def dfs(i, f):
    if i == n-1:
        return sum(list(map(int, f.split("+"))))
    return dfs(i+1, f+s[i+1])+\
           dfs(i+1, f+"+"+s[i+1])

s = input()
n = len(s)
print(dfs(0, s[0]))
Buggy python submission (verdict: Runtime Error):
N = int(input())
list = []
for i in range(N):
  list.attend(N)
  N -= 1
print(sum(list))

Fixed submission:
N = int(input())
print(N*(N+1)//2)
Buggy python submission (verdict: Runtime Error):
from collections import Counter

N,*A = map(int,open(0).read().split())
#j - i = Aj + Ai
#j - Aj = Ai + i
#L = i + Ai, R = j - Aj とおく
L = []
R = []
for i in range(N):
    L.append(i+1 + A[i])
    R.append(i+1 - A[i])
l = Counter(L)
r = Counter(R)
 
cnt = 0
for i in range(1,N+1):
    if i in l and i in r:
        cnt += l[i] * r[i]
        a.append(i)
print(cnt)

Fixed submission:
from collections import Counter

N,*A = map(int,open(0).read().split())
#j - i = Aj + Ai
#j - Aj = Ai + i
#L = i + Ai, R = j - Aj とおく
L = []
R = []
for i in range(N):
    L.append(i+1 + A[i])
    R.append(i+1 - A[i])
l = Counter(L)
r = Counter(R)
 
#print(l)
#print(r)

cnt = 0
a=[]
for i in range(1,N+1):
    if i in l and i in r:
        cnt += l[i]*r[i]
        a.append(i)
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
def m(list1,n): 
    mul=1
    for i in range(n): 
         mul=mul*list1[i] 
    return mul 
      
n=int(input())
arr=list(map(int,input().split()))
if m(arr,n)>pow(10,18):
    print(-1)
else:
    print(m(arr,n)) 
 


Fixed submission:
n=int(input())
arr=list(map(int,input().split()))
ans=int(1)
temp=int(0)
for i in range(n):
  if(ans>(10**18)):
    ans=-1
  if(ans!=-1):
  	ans*=arr[i]
  if(arr[i]==0):
    temp=int(1)
if(ans>(10**18)):
  ans=-1
if(temp==1):
  ans=0
print(int(ans))

Buggy python submission (verdict: Runtime Error):
def m(list1,n): 
    mul=1
    for i in range(n): 
         mul=mul*list1[i] 
    return mul 
      
n=int(input())
arr=list(map(int,input().split()))
if m(arr)>pow(10,18):
    print(-1)
else:
    print(m(arr)) 
 


Fixed submission:
n=int(input())
arr=list(map(int,input().split()))
ans=int(1)
temp=int(0)
for i in range(n):
  if(ans>(10**18)):
    ans=-1
  if(ans!=-1):
  	ans*=arr[i]
  if(arr[i]==0):
    temp=int(1)
if(ans>(10**18)):
  ans=-1
if(temp==1):
  ans=0
print(int(ans))

Buggy python submission (verdict: Time Limit Exceeded):
def m(list1): 
      
    mul=1
    for x in list1: 
         mul=mul*x  
    return mul 
      
n=int(input())
arr=list(map(int,input().split()))
if m(arr)>(10**18):
    print(-1)
else:
    print(m(arr)) 
 


Fixed submission:
n=int(input())
arr=list(map(int,input().split()))
ans=int(1)
temp=int(0)
for i in range(n):
  if(ans>(10**18)):
    ans=-1
  if(ans!=-1):
  	ans*=arr[i]
  if(arr[i]==0):
    temp=int(1)
if(ans>(10**18)):
  ans=-1
if(temp==1):
  ans=0
print(int(ans))

Buggy python submission (verdict: Time Limit Exceeded):
def m(list1): 
      
    mul=1
    for x in list1: 
         mul=mul*x  
    return mul 
      
n=int(input())
arr=list(map(int,input().split()))
if m(arr)>pow(10,18):
    print(-1)
else:
    print(m(arr)) 
 


Fixed submission:
n=int(input())
arr=list(map(int,input().split()))
ans=int(1)
temp=int(0)
for i in range(n):
  if(ans>(10**18)):
    ans=-1
  if(ans!=-1):
  	ans*=arr[i]
  if(arr[i]==0):
    temp=int(1)
if(ans>(10**18)):
  ans=-1
if(temp==1):
  ans=0
print(int(ans))
Buggy python submission (verdict: Time Limit Exceeded):
from math import gcd


def prime_factorize(n):
    a=set()
    while n%2==0:
        a.add(2)
        n //=2
    f=3
    while f**2<=n:
        if n%f==0:
            a.add(f)
            n //=f
        else:f +=2
    if n!=1:a.add(n)
    return a


n=int(input())
A=list(map(int,input().split()))
prime=[True for _ in range(10**6+1)]

flag=0
for i in A:
    for j in prime_factorize(i):
        if prime[j]:
            for k in range(j,10**6+1,j):
                prime[k]=False
        else:
            flag=1
            break
if flag==0:print("pairwise coprime");exit()
line=[0]*n
line[0]=A[0]
for i in range(1,n):
    line[i]=gcd(line[i-1],A[i])
if line[-1]==1:print("setwise coprime");exit()
print("not coprime")


Fixed submission:
from math import gcd


def prime_factorize(n):
    a=set()
    while n%2==0:
        a.add(2)
        n //=2
    f=3
    while f**2<=n:
        if n%f==0:
            a.add(f)
            n //=f
        else:f +=2
    if n!=1:a.add(n)
    return a


n=int(input())
A=list(map(int,input().split()))
prime=[True for _ in range(10**6+1)]

flag=0
for i in A:
    for j in prime_factorize(i):
        if prime[j]:
            for k in range(j,10**6+1,j):
                prime[k]=False
        else:
            flag=1
            break
if flag==0:print("pairwise coprime");exit()
line=[0]*n
line[0]=A[0]
for i in range(1,n):
    line[i]=gcd(line[i-1],A[i])
if line[-1]==1:print("setwise coprime");exit()
print("not coprime")