Problem:


Score : 200 points

Problem Statement

You are given two positive integers A and B. Compare the magnitudes of these numbers.

Constraints

1 ≤ A, B ≤ 10^{100}

Neither A nor B begins with a 0.

Input

Input is given from Standard Input in the following format:

A
B

Output

Print GREATER if A>B, LESS if A<B and EQUAL if A=B.

Sample Input 1

36
24

Sample Output 1

GREATER

Since 36>24, print GREATER.

Sample Input 2

850
3777

Sample Output 2

LESS

Sample Input 3

9720246
22516266

Sample Output 3

LESS

Sample Input 4

123456789012345678901234567890
234567890123456789012345678901

Sample Output 4

LESS



Sample input:
36
24


Sample output:
GREATER

Submission status: Accepted

Solution code:
a,b=[list(input()) for i in range(2)]
if len(a)>len(b):
  print("GREATER")
elif len(a)<len(b):
  print("LESS")
elif a>b:
  print("GREATER")
elif a<b:
  print("LESS")
else:
  print("EQUAL")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

ans = ''
if A>B:
  ans = 'GREATER'
elif A<B:
  ans = 'LESS'
else:
  ans = 'EQUAL'
  
print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a>b:
  print("GREATER")
elif a==b:
  print("EQUAL")
else:
  print("LESS")

Submission status: Accepted

Solution code:
A = input()
B = input()

if len(A) > len(B):
    print('GREATER')
elif len(A) < len(B):
    print('LESS')
else:
    for i in range(len(A)):
        if int(A[i]) > int(B[i]):
            print('GREATER')
            break
        elif int(A[i]) < int(B[i]):
            print('LESS')
            break
        else:
            if i == len(A) - 1:
                print('EQUAL')

Submission status: Accepted

Solution code:
a, b = [int(input()) for _ in range(2)]
if a > b:
  print("GREATER")
elif a == b:
  print("EQUAL")
else:
  print("LESS")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A > B:
  print('GREATER')
elif B > A:
  print('LESS')
else:
  print('EQUAL')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b:
  print("GREATER")
elif a == b:
  print("EQUAL")
else:
  print("LESS")

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())

if a>b:
    print('GREATER')
elif a<b:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
print("LESS" if a<b else "GREATER" if a>b else "EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print("GREATER" if a > b else "EQUAL" if a == b else "LESS")

Submission status: Accepted

Solution code:
A=int(input()); B=int(input())
if A > B:
    print("GREATER")
elif A < B:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print("GREATER" if a > b else "LESS" if a < b else "EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a >  b: print('GREATER')
if a <  b: print('LESS')
if a == b: print('EQUAL')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A > B:
    print("GREATER")
elif A < B:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    A = inputInt()
    B = inputInt()
    
    if A > B:
        print("GREATER")
    elif A < B:
        print("LESS")
    else:
        print("EQUAL")
    
if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
A = input()
B = input()
max_len = max(len(A), len(B))
A = A.zfill(max_len)
B = B.zfill(max_len)

for a, b in zip(A, B):
  if int(a) > int(b):
    print("GREATER")
    exit()
  elif int(a) < int(b):
    print("LESS")
    exit()
  else:
    pass

print("EQUAL")

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline

a = int(input())
b = int(input())

if a > b:
    print("GREATER")
elif a < b:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
A=input()
B=input()
def judge(A,B):
    if len(A)>len(B):
        print("GREATER")
        return
    elif len(A)<len(B):
        print("LESS")
        return
    else:
        i=0
        while i<len(A):
            a=A[i]
            b=B[i]
            if a>b:
                print("GREATER")
                return
            elif a==b:
                i+=1
                continue
            else:
                print("LESS")
                return
        print("EQUAL")
        return
judge(A,B)

Submission status: Accepted

Solution code:

a = int(input())
b = int(input())
if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
a, b = [int(input()) for _ in range(2)]
if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a == b:
    print("EQUAL")
elif a > b:
    print("GREATER")
else:
    print("LESS")

Submission status: Accepted

Solution code:
a = input()
b = input()

ans = "EQUAL"
if len(a)>len(b):
    ans = "GREATER"
elif len(a)<len(b):
    ans = "LESS"
else:
    for i in range(len(a)):
        if int(a[i])>int(b[i]):
            ans = "GREATER"
            break
        elif int(a[i])<int(b[i]):
            ans = "LESS"
            break
print(ans)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A > B :
    print('GREATER')
elif A < B :
    print('LESS')
else :
    print('EQUAL')

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
if A>B:print('GREATER')
elif A<B:print('LESS')
else:print('EQUAL')

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a>b:
    print("GREATER")
elif b>a:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a,b=[int(input()) for _ in range(2)]

print('GREATER' if a>b else 'LESS' if a<b else 'EQUAL')

Submission status: Accepted

Solution code:
import math
a = int(input())
b = int(input())
if a > b:
  print('GREATER')
elif a == b:
  print('EQUAL')
else:
  print('LESS')

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a==b:
    print('EQUAL')
elif a>=b:
    print('GREATER')
else:
    print('LESS')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b:print("GREATER")
elif a < b:print("LESS")
else:print("EQUAL")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, fractions, itertools


def solve(A: str, B: str):
    l = max(len(A), len(B))
    A = A.zfill(l)
    B = B.zfill(l)
    if (A > B):
        print('GREATER')
    elif (B > A):
        print('LESS')
    else:
        print('EQUAL')
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = next(tokens)  # type: int
    B = next(tokens)  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    A = int(input())
    B = int(input())
    if A > B:
        print('GREATER')
    elif B > A:
        print('LESS')
    else:
        print('EQUAL')


main()

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
if A>B:
  print("GREATER")
elif A<B:
  print("LESS")
elif A==B:
  print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a<b :
    print('LESS')

elif a == b :
    print('EQUAL')

elif a>b:
    print('GREATER')

Submission status: Accepted

Solution code:
i=input
a=int(i())
b=int(i())
print(["GREATER","LESS","EQUAL"][(b>=a)+(a==b)])

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A==B:
  print("EQUAL")
elif A<B:
  print("LESS")
else:
  print("GREATER")

Submission status: Accepted

Solution code:
# ABC 59, b - comparison
A = int(input())
B = int(input())

if A > B:
    print('GREATER')
elif A == B:
    print("EQUAL")
else:
    print("LESS")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a < b:
  print("LESS")
elif a == b:
  print("EQUAL")
else:
  print("GREATER")

Submission status: Accepted

Solution code:
A=input()
B=input()

if len(A)>len(B):
    print("GREATER")

elif len(A)<len(B):
    print("LESS")
else:
    for i in range(len(A)):
        if int(A[i])>int(B[i]):
            print("GREATER")
            exit()
        elif int(A[i])<int(B[i]):
            print("LESS")
            exit()
    print("EQUAL")

Submission status: Accepted

Solution code:
a = input()
b = input()

if a == b:
    print("EQUAL")
elif a > b:
    print("GREATER")
else :
    print("LESS")

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a = input().split()
    a = list(map(lambda x: x.capitalize(), a))
    a,b,c = a
    print(a[0]+b[0]+c[0])
    return

#B
def B():
    a = II()
    b = II()
    if a > b:
        print("GREATER")
    if a < b:
        print("LESS")
    if a == b:
        print("EQUAL")
    return

#C
def C():
    return

#D
def D():
    s = S()
    for i in range(len(s) - 1):
        if s[i] == s[i+1]:
            print(i + 1, i + 2)
            return
    for i in range(len(s) - 2):
        if s[i] == s[i + 2]:
            print(i + 1, i + 3)
            return
    print(-1, -1)

    return


#Solve
if __name__ == '__main__':
    B()

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
print("EQUAL" if A==B else "GREATER" if A>B else "LESS")

Submission status: Accepted

Solution code:
def main():
    a = int(input())
    b = int(input())

    if a > b:
        print("GREATER")
    elif a < b:
        print("LESS")
    else:
        print("EQUAL")


if __name__ == "__main__":

    main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print('EQUAL' if a == b else 'GREATER' if a > b else 'LESS')

Submission status: Accepted

Solution code:
a,b=map(int,open(0))
print('GREATER' if a>b else 'ELQEUSASL'[a<b::2])

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A > B:
    print('GREATER')
elif B > A:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:

def main():
    a = list(map(int, list(input())))
    b = list(map(int, list(input())))

    if len(a) > len(b):
        print('GREATER')
    elif len(a) < len(b):
        print('LESS')
    else:
        flg = 2
        for i in range(len(a)):
            if a[i] > b[i]:
                flg = 1
                break
            elif a[i] < b[i]:
                flg = 0
                break

        if flg == 2:
            print('EQUAL')
        elif flg == 1:
            print('GREATER')
        else:
            print('LESS')





if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A > B:
  print("GREATER")
elif A < B:
  print("LESS")
else:
  print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b:
  print('GREATER')
elif a< b:
  print('LESS')
else :
  print('EQUAL')

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a>b:print("GREATER")
elif a<b:print("LESS")
else:print("EQUAL")

Submission status: Accepted

Solution code:
import math
a=int(input())
b=int(input())
a_log=math.log10(a)
b_log=math.log10(b)
if a>b:
    print("GREATER")
elif a==b:
    print("EQUAL")
else:
    print("LESS")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a == b:
  print("EQUAL")
elif a < b:
  print("LESS")
else:
  print("GREATER")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

def main(A, B):
    if(A>B):
        print("GREATER")
    elif(B>A):
        print("LESS")
    else:
        print("EQUAL")

    
if __name__ == '__main__':
    A = int(input())
    B = int(input())
    
    main(A, B)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#ABC59 B

a = int(input())
b = int(input())

if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
elif a == b:
    print('EQUAL')

Submission status: Accepted

Solution code:

A = int(input())
B = int(input())

if A>B:
    print ("GREATER")

elif A<B:
    print ("LESS")

else:
    print ("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a == b:
    print("EQUAL")
elif a < b:
    print("LESS")
else:
    print("GREATER")

Submission status: Accepted

Solution code:
A = input()
B = input()

if len(A) > len(B):
    print('GREATER')
elif len(A) == len(B):
    for n in range(len(A)):
        if int(A[n]) > int(B[n]):
            print('GREATER')
            break
        if int(A[n]) == int(B[n]):
            continue
        if int(A[n]) < int(B[n]):
            print('LESS')
            break
    else:
        print('EQUAL')
else:
    print('LESS')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a < b:
    print("LESS")
elif a > b:
    print("GREATER")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A > B:
    print('GREATER')
elif A < B:
    print('LESS')
elif A == B:
    print('EQUAL')

Submission status: Accepted

Solution code:
a = input()
b = input()
if len(a) > len(b):
	print("GREATER")
elif len(a) < len(b):
	print("LESS")
else:
	for i in range(len(a)):
		if a[i] > b[i]:
			print("GREATER")
			exit()
		elif a[i] < b[i]:
			print("LESS")
			exit()
	print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a==b:
  print("EQUAL")
elif a<b:
  print("LESS")
else:
  print("GREATER")

Submission status: Accepted

Solution code:
a = input()
b = input()

la = len(a)
lb = len(b)

if la > lb:
    print('GREATER')
elif la < lb:
    print('LESS')
else:
    for i in range(la):
        num_a = int(a[i])
        num_b = int(b[i])
        
        if num_a > num_b:
            print('GREATER')
            exit()
        elif num_a < num_b:
            print('LESS')
            exit()
    print('EQUAL')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(A: int, B: int):
    if len(A) > len(B):
        ret = 'GREATER'
    elif len(A) < len(B):
        ret = 'LESS'
    else:
        ret = 'EQUAL'
        for i in range(len(A)):
            if A[i] > B[i]:
                ret = 'GREATER'
                break
            elif A[i] < B[i]:
                ret = 'LESS'
                break
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = str(next(tokens))  # type: int
    B = str(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A==B:
    print("EQUAL")
elif A > B:
    print("GREATER")
else:
    print("LESS")

Submission status: Accepted

Solution code:
from sys import stdin
A = int(stdin.readline().rstrip())
B = int(stdin.readline().rstrip())
if A > B:
    print("GREATER")
elif B > A:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a>b:
   print("GREATER")
elif a<b:
    print("LESS")
elif a==b:
    print("EQUAL")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A > B:
    print("GREATER")
elif B > A:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a,b=[int(input()) for i in range(2)]
if a>b:
    print("GREATER")
elif a<b:
    print("LESS")
else:print("EQUAL")

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

A = int(input())
B = int(input())

if A > B:
    print("GREATER")
elif A < B:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a = input()
b = input()
if(len(a) > len(b)):
    print("GREATER")
elif(len(a) < len(b)):
    print("LESS")
else:
    flag = True
    for i in range(len(a)):
        if(int(a[i]) > int(b[i])):
            flag = False
            print("GREATER")
            break
        elif(int(a[i]) < int(b[i])):
            flag = False
            print("LESS")
            break
    if(flag):
        print("EQUAL")

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

A = n()
B = n()

if A > B:
    print('GREATER')
elif A < B:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b :
	print('GREATER')
elif a == b :
	print('EQUAL')
else :
	print('LESS')

Submission status: Accepted

Solution code:
def abc():
    a = int(input())
    b = int(input())
    if a > b:
        print('GREATER')
        return
    if a < b:
        print('LESS')
        return
    print('EQUAL')


abc()

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if (A > B):
    print("GREATER")
elif (A < B):
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
import string

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

#
# A, B, C = list(map(int, sys.stdin.readline().split()))
# a = A
# ok = False
# for _ in range(1000):
#     ok |= a % B == C
#     a += A
# if ok:
#     print('YES')
# else:
#     print('NO')
#

A, B = [int(sys.stdin.readline()) for _ in range(2)]
if A>B:
    print('GREATER')
elif A<B:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
a = int(raw_input())
b = int(raw_input())
if a < b:
	print "LESS"
elif a == b:
	print "EQUAL"
else:
	print "GREATER"

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A > B:
    print('GREATER')
elif B > A:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a > b :
    print("GREATER")
elif a == b :
    print("EQUAL")
else :
    print("LESS")

Submission status: Accepted

Solution code:
import numpy as np

def main():
    a=int(input())
    b=int(input())
    if(a>b):
        print("GREATER")
    elif(a<b):
        print("LESS")
    else:
        print("EQUAL")

def inputList():
    a=list(map(int,input().split()))
    return a

def multisort(li,index):
    return sorted(li,key=lambda x: x[index])

if(__name__=='__main__'):
    main()

Submission status: Accepted

Solution code:
a = int(input()); b = int(input())
print('EQUAL' if a == b else ['LESS', 'GREATER'][a > b])

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

answer = ''
if a > b:
  answer = 'GREATER'
elif a == b:
  answer = 'EQUAL'
else:
  answer = 'LESS'

print(answer)

Submission status: Accepted

Solution code:
A, B = input(), input()
C = len(A) - len(B)
if C == 0 and A > B or C > 0:
    print("GREATER")
elif C == 0 and A < B or C < 0:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
A, B = input(), input()
if len(A) > len(B):
    print("GREATER")
elif len(A) < len(B):
    print("LESS")
elif A > B:
    print("GREATER")
elif A < B:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b:
    print('GREATER')
elif a == b:
    print('EQUAL')
else:
    print('LESS')

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a==b:
  print('EQUAL')
elif a<b:
  print('LESS')
else:
  print('GREATER')

Submission status: Accepted

Solution code:
a = input()
b = input()
flag = 0
if len(a) > len(b):
    print('GREATER')
    flag = 1
elif len(a) < len(b):
    print('LESS')
    flag = -1
else:
    for i in range(len(a)):
        if a[i] > b[i]:
            print('GREATER')
            flag = 1
            break
        elif a[i] < b[i]:
            print('LESS')
            flag = -1
            break
if flag == 0:
    print('EQUAL')

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())

if a>b:
    print("GREATER")

elif a<b:
    print("LESS")

else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a>b:
  print('GREATER')
elif a==b:
  print('EQUAL')
else:
  print('LESS')

Submission status: Accepted

Solution code:
a = input()
b = input()

def solve(a,b,n,i):
    if n == i:
        return(print("EQUAL"))
    if a[i] >b[i]:
        print("GREATER")
    elif b[i]>a[i]:
        print("LESS")
    else:
        solve(a,b,n,i+1)

if len(a)>len(b):
    print("GREATER")
elif len(b)>len(a):
    print("LESS")
else:
    solve(a,b,len(a),0)

Submission status: Accepted

Solution code:
A = input()
B = input()
if len(A) > len(B): print('GREATER')
elif len(A) < len(B): print('LESS')
else:
	for i in range(0, len(A)):
		if A[i] > B[i]:
			print('GREATER')
			break
		if A[i] < B[i]:
			print('LESS')
			break
		if i == len(A)-1:
			print('EQUAL')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A>B : print("GREATER")
elif A==B : print("EQUAL")
else : print("LESS")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

a = int(input())
b = int(input())
if a > b:
    ans = 'GREATER'
elif a < b:
    ans = 'LESS'
else:
    ans = 'EQUAL'
print(ans)

Submission status: Accepted

Solution code:
a=input()
b=input()
c=len(a)
d=len(b)
if c>d:
  print("GREATER")
elif c<d:
  print("LESS")
else:
  flag=0
  for i in range(c):
    if int(a[i])>int(b[i]):
      print("GREATER")
      flag=1
      break
    elif int(a[i])<int(b[i]):
      print("LESS")
      flag=1
      break
    else:
      continue
  if flag==0:
    print("EQUAL")

Submission status: Accepted

Solution code:
# 2019/06/03
# AtCoder Beginner Contest 059 - B

# Input
a = int(input())
b = int(input())

# Check
if a > b:
    ans = "GREATER"
elif a < b:
    ans = "LESS"
else:
    ans = "EQUAL"

# Output
print(ans)

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if(A > B):
    print("GREATER")
elif(A < B):
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A > B:
    print('GREATER')
elif A < B:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print("GREATER" if a>b else "LESS" if b>a else "EQUAL")

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A == B:
    ans = "EQUAL"
elif A < B:
    ans = "LESS"
else:
    ans = "GREATER"
print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b:
    print("GREATER")
if a == b:
    print("EQUAL")
if a < b:
    print("LESS")

Submission status: Accepted

Solution code:

a = input()
b = input()
	
ans = "EQUAL"
la, lb = len(a), len(b)
if la < lb:
	ans = "LESS"
elif la > lb:
	ans = "GREATER"
else:
	for i in range(la):
		if a[i] < b[i]:
			ans = "LESS"
			break
		elif a[i] > b[i]:
			ans = "GREATER"
			break
print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b:
  print("GREATER")
elif a < b:
  print("LESS")
else:
  print("EQUAL")

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

def solve():
    A = int(input())
    B = int(input())
    if A > B:
        print("GREATER")
    elif A < B:
        print("LESS")
    else:
        print("EQUAL")


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a == b:
    print('EQUAL')
elif a>b:
    print('GREATER')
else:
    print('LESS')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())

if A > B:
    print('GREATER')
elif A == B:
    print('EQUAL')
else:
    print('LESS')

Submission status: Accepted

Solution code:
from sys import exit, stdin
a = int(stdin.readline().rstrip())
b = int(stdin.readline().rstrip())
if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
elif a == b:
    print('EQUAL')

Submission status: Accepted

Solution code:
num1 = int(input())
num2 = int(input())

if num1 > num2:
    print("GREATER")
elif num1 < num2:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a>b:
    print("GREATER")
elif a<b:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a = [int(input()) for _ in range(2)]
if a[0] > a[1]:
    print('GREATER')
elif a[0] < a[1]:
    print('LESS')
else:
    print('EQUAL')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if A == B:
  print('EQUAL')
elif A < B:
  print('LESS')
else :
  print('GREATER')

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
if a>b : ans='GREATER'
elif a==b:ans='EQUAL'
else:ans='LESS'
print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a > b:print('GREATER')
elif a < b:print('LESS')
else:print('EQUAL')

Submission status: Accepted

Solution code:
a = int(input()); b = int(input()); print("GREATER" if a > b else "EQUAL" if a == b else "LESS" )

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math

mod = 10**9+7

A = int(input())
B = int(input())

if A > B:
    print("GREATER")
elif A < B:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
A = input()
B = input()
flag = True
if len(A) > len(B):
  print("GREATER")
  flag = False
elif len(A) < len(B):
  print("LESS")
  flag = False
elif len(A) == len(B):
  for i in range(len(A)):
    if int(A[i]) > int(B[i]):
      print("GREATER")
      flag = False
      break
    elif int(A[i]) < int(B[i]):
      print("LESS")
      flag = False
      break

  
if flag:
  print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

print('GREATER' if a > b else 'EQUAL' if a == b else 'LESS')

Submission status: Accepted

Solution code:
A=list(map(int,list(input())))
B=list(map(int,list(input())))

if len(A) < len(B):
    print("LESS")
elif len(A) > len(B):
    print("GREATER")
elif A == B:
    print("EQUAL")
else:
    for i in range(len(A)):
        if A[i]<B[i]:
            print("LESS")
            break
        elif A[i]>B[i]:
            print("GREATER")
            break

Submission status: Accepted

Solution code:
A,B = int(input()),int(input())
if A>B:
    print("GREATER")
elif A<B:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())

if a>b:
  print("GREATER")

elif a<b:
  print("LESS")
else:
  print("EQUAL")

Submission status: Accepted

Solution code:
# 入力
A=int(input())
B=int(input())

if A>B:
  print('GREATER')
elif A==B:
  print('EQUAL')
else:
  print('LESS')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print(['EQUAL', 'GREATER', 'LESS'][(a>b)-(a<b)])

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
if(A>B):
  print('GREATER')
elif(A==B):
  print('EQUAL')
else:
  print('LESS')

Submission status: Accepted

Solution code:
A=int(input())
B=int(input())
print("GREATER"if A>B else ("LESS"if A<B else "EQUAL"))

Submission status: Accepted

Solution code:
a = input()
b = input()

if len(a) > len(b):
    print('GREATER')
elif len(a) == len(b):
    for i in range(len(a)):
        if a[i] > b[i]:
            print('GREATER')
            exit()
        elif a[i] < b[i]:
            print('LESS')
            exit()
    print('EQUAL')
else:
    print('LESS')

Submission status: Accepted

Solution code:
a=int(input())
b=int(input())
print('GREATER'if a>b else 'ELQEUSASL'[a<b::2])

Submission status: Accepted

Solution code:
#59
a = int(input())
b = int(input())
if a>b:
    print('GREATER')
elif a==b:
    print('EQUAL')
else:
    print('LESS')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
if a == b:
	print('EQUAL')
else:
	print('GREATER' if a>b else 'LESS')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
print("GREATER" if (A > B) else "LESS" if (A < B) else "EQUAL")

Submission status: Accepted

Solution code:
A = input()
B = input()

def compare(A,B):
    if A == B:
        return 'EQUAL'
    if len(A) > len(B):
        return 'GREATER'
    if len(B) > len(A):
        return 'LESS'
    for i in range(len(A)):
        a = int(A[i])
        b = int(B[i])
        if a > b:
            return 'GREATER'
        if b > a:
            return 'LESS'

print(compare(A,B))

Submission status: Accepted

Solution code:


a = int(input())
b = int(input())
if a>b:
  print('GREATER')
elif a<b:
  print('LESS')
else:
  print('EQUAL')

Submission status: Accepted

Solution code:
# ABC058B - Comparison
a, b = list(map(int, [input().rstrip() for _ in range(2)]))
if a > b:
    print("GREATER")
elif a < b:
    print("LESS")
else:
    print("EQUAL")

Submission status: Accepted

Solution code:
import sys
from collections import Counter

a = int(input())
b = int(input())

if a < b:
    print('LESS')
elif a > b:
    print('GREATER')
elif a == b:
    print('EQUAL')

Submission status: Accepted

Solution code:
A = int(input())
B = int(input())
print('GREATER' if A > B else 'LESS' if A < B else 'EQUAL')

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print('GREATER' if a>b else 'LESS' if a<b else 'EQUAL')