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:
import sys
input = sys.stdin.readline


def read():
    A = input().strip()
    B = input().strip()
    return A, B


def solve(A, B):
    if len(A) > len(B):
        return "GREATER"
    elif len(B) > len(A):
        return "LESS"
    else:
        for i in range(len(A)):
            if int(A[i]) > int(B[i]):
                return "GREATER"
            elif int(B[i]) > int(A[i]):
                return "LESS"
    return "EQUAL"


if __name__ == '__main__':
    inputs = read()
    print(solve(*inputs))

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())
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())
if a>b:
  print('GREATER')
elif a<b:
  print('LESS')
else:
  print('EQUAL')

Submission status: Accepted

Solution code:
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]

A = ri()
B = ri()
print('GREATER' if A > B else 'LESS' if A < B else 'EQUAL')

Submission status: Accepted

Solution code:
import sys
A = input()
B = input()
if len(A) < len(B):
    print('LESS')
elif len(A) > len(B):
    print('GREATER')
else:
    for i in range(len(A)):
        if A[i] < B[i]:
            print('LESS')
            sys.exit()
        elif A[i] > B[i]:
            print('GREATER')
            sys.exit()
    print('EQUAL')

Submission status: Accepted

Solution code:
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())
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('EQUAL')
else:
  print('LESS')

Submission status: Accepted

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

if A<B:
  print("LESS")
elif B<A:
  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')
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())
ans = 'GREATER'
if a == b:
  ans = 'EQUAL'
elif a < b:
  ans = 'LESS'
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a, b = map(int, open(0).read().split())
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())
if a == b:
    print("EQUAL")
elif a > b:
    print("GREATER")
elif a < b:
    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, 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 = input()
b = input()

if len(a) != len(b):
    ans = 'GREATER' if len(a)>len(b) else 'LESS'
elif a != b:
    ans = 'GREATER' if a > b else 'LESS'
else:
    ans = 'EQUAL'

print(ans)

Submission status: Accepted

Solution code:
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()

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:
import sys
A = input()
B = input()
if len(A) > len(B):
    print('GREATER')
    sys.exit()
elif len(A) < len(B):
    print('LESS')
    sys.exit()
elif A == B:
    print('EQUAL')
    sys.exit()

for i in range(len(A)):
    if A[i] == B[i]:
        i += 1
        continue
    elif A[i] > B[i]:
        print('GREATER')
        sys.exit()
    elif A[i] < B[i]:
        print('LESS')
        sys.exit()
print('EQUAL')

Submission status: Accepted

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

a = i()
b = i()

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("EQUAL")
else:
  print("LESS")

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:

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
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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('LESS')
if a==b:
  print('EQUAL')
if a>b:
  print('GREATER')

Submission status: Accepted

Solution code:
import math
import collections
import fractions
import itertools

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
A = input().strip()
B = input().strip()
if len(A)>len(B):
    print("GREATER")
elif len(A)<len(B):
    print("LESS")
else:
    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("EQUAL")
elif A>B:
  print("GREATER")
else:
  print("LESS")

Submission status: Accepted

Solution code:
import math
import collections
import fractions
import itertools

def solve():
    a = int(input())
    b = int(input())
    if a > b:
        print("GREATER")
    elif b > a:
        print("LESS")
    else:
        print("EQUAL")
    return 0

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
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()

gt = 'GREATER'
lt = 'LESS'
eq = 'EQUAL'

if len(a) > len(b):
    print(gt)
elif len(a) < len(b):
    print(lt)
elif a == b:
    print(eq)
else:
    for ca, cb in zip(a, b):
        if ca == cb:
            continue
        if ca > cb:
            print(gt)
        else:
            print(lt)
        exit(0)

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")
else:
    print("EQUAL")

Submission status: Accepted

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

A = list(str(input()))
B = list(str(input()))

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# ABC059_B
A = int(input())
B = int(input())
C = A - B

if C > 0:
    print("GREATER")
elif C == 0:
    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:
# n, m, l = map(int, input().split())

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import sys
input = sys.stdin.readline

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

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

Submission status: Accepted

Solution code:
# n, m, l = map(int, input().split())

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

# import sys
# input = sys.stdin.readline

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("EQUAL")
elif A>B:
    print("GREATER")
else:
    print("LESS")

Submission status: Accepted

Solution code:
A=input()
B=input()
A='0'*(101-len(A))+A
B='0'*(101-len(B))+B
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:
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())

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("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("EQUAL")
else:
    print("LESS")

Submission status: Accepted

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


resolve()

Submission status: Accepted

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

if A < 0 or A > 10 ** 100 or B < 0 or B > 10 ** 100:
    sys.exit()

if A - B > 0:
    print("GREATER")
if A - B == 0:
    print("EQUAL")
if A - B < 0:
    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("GREATER" if A > B else "LESS" if A < B else "EQUAL")

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")
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("EQUAL")
else: print("LESS")

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())
len_a = len(a)
len_b = len(b)

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

Submission status: Accepted

Solution code:
n = int(input())
m = int(input())

if n > m: print('GREATER')
elif n < m: print('LESS')
else: print('EQUAL')

Submission status: Accepted

Solution code:
a,b=int(input()),int(input());print(['LESS','GREATER'][a>b] if a!=b else '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:
#!/usr/bin/env python3

def main():
    A = int(input())
    B = int(input())
    if A > B:
        print("GREATER")
    elif A == B:
        print("EQUAL")
    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("EQUAL")
else:
    print("LESS")

Submission status: Accepted

Solution code:
#

import sys
input=sys.stdin.readline

def main():
    A=int(input())
    B=int(input())
    if A>B:
        print("GREATER")
    elif A==B:
        print("EQUAL")
    else:
        print("LESS")
    
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:
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 python
# coding: utf-8

# In[4]:


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


# In[ ]:

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:
a = list(input())
b = list(input())

a = [int(a[i]) for i in range(len(a))]
b = [int(b[i]) for i in range(len(b))]

flag = True
if len(a) > len(b):
    print('GREATER')
    flag = False
elif len(b) > len(a):
    print('LESS')
    flag = False
else:
    for i in range(len(a)):
        if a[i] > b[i]:
            print('GREATER')
            flag = False
            break
        elif b[i] > a[i]:
            print('LESS')
            flag = False
            break
if flag:
    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 = 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
from collections import deque
from collections import defaultdict

#自作関数群
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):#階乗
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):#コンビネーション
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def combmod(n,r,mod):
	return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
	r=copyQueue(q)
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): # root
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): # much time
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): #j:aの個数
			k = i-a*j
			if k%b==0:
				return i
	return -1
def copyQueue(q):
	nq = queue.Queue()
	n = q.qsize()
	for i in range(n):
		x = q.get()
		q.put(x)
		nq.put(x)
	return nq
def get_sieve_of_eratosthenes(n):
	#data = [2]
	data = [0,0,0]
	for i in range(3,n+1,2):
		data.append(i)
		data.append(0)
	for i in range(len(data)):
		interval = data[i]
		if interval!=0:
			for j in range(i+interval,n-1,interval):
				data[j] = 0
	#ans = [x for x in data if x!=0]
	ans = data[:]
	return ans

a = readChar()
b = readChar()

al = len(a)
bl = len(b)

if al>bl:
	print("GREATER")
	exit()
elif al<bl:
	print("LESS")
	exit()

for i in range(al):
	if a[i]>b[i]:
		print("GREATER")
		exit()
	elif a[i]<b[i]:
		print("LESS")
		exit()

print("EQUAL")

Submission status: Accepted

Solution code:
import math
from collections import deque
from collections import defaultdict

#自作関数群
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):#階乗
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):#コンビネーション
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def combmod(n,r,mod):
	return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
	r=copyQueue(q)
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): # root
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): # much time
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): #j:aの個数
			k = i-a*j
			if k%b==0:
				return i
	return -1
def copyQueue(q):
	nq = queue.Queue()
	n = q.qsize()
	for i in range(n):
		x = q.get()
		q.put(x)
		nq.put(x)
	return nq
def get_sieve_of_eratosthenes(n):
	#data = [2]
	data = [0,0,0]
	for i in range(3,n+1,2):
		data.append(i)
		data.append(0)
	for i in range(len(data)):
		interval = data[i]
		if interval!=0:
			for j in range(i+interval,n-1,interval):
				data[j] = 0
	#ans = [x for x in data if x!=0]
	ans = data[:]
	return ans

a = readInt()
b = readInt()

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())
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()), 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 = 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

def calc(A, B) : 
  a = math.log(A)
  b = math.log(B)
  if a > b : 
    print('GREATER')
  elif b > a : 
    print('LESS')
  else : 
    print('EQUAL')
    
A = int(input())
B = int(input())

calc(A, B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

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

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

main()

Submission status: Accepted

Solution code:
a = int(input())
b = int(input())
print('GREATER') if a > b else print('LESS') if a < b 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 a<b:
  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:
a = int(input())
b = int(input())
ret = ''
if( a > b):
    ret = 'GREATER'
elif( a < b):
    ret = 'LESS'
else:
    ret = 'EQUAL'

print(ret)

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:
def resolve():
    a = int(input())
    b = int(input())

    ans = str()

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

    print(ans)
resolve()

Submission status: Accepted

Solution code:
from sys import exit
A = input()
B = input()
if len(A) > len(B):
  print("GREATER")
elif len(A) < len(B):
  print("LESS")
else:
  for a,b in zip(A,B):
    if a > b:
      print("GREATER")
      exit()
    elif a < b:
      print("LESS")
      exit()
  print("EQUAL")

Submission status: Accepted

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

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 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:
a = int(input())
b = int(input())

if a > b:
    print('GREATER')
elif a == b:
    print('EQUAL')
elif a < b:
    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:
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("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(A== B):
  print("EQUAL")
else:
  print("LESS")

Submission status: Accepted

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

al = len(a)
bl = len(b)

if al>bl:
    print('GREATER')
elif al<bl:
    print('LESS')
else:
    i = 0
    check = 0
    for i in range(al):
        if a[i] == b[i]:
            pass
        else:
            check += int(a[i]) - int(b[i])
            break

    if check > 0:
        print('GREATER')
    elif check < 0:
        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:
A, B = int(input()), 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'))

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('LESS')
elif a==b:
    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 = 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 b>a:
	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:
    for a, b in zip(A, B):
        if a > b:
            print("GREATER")
            break
        elif a < b:
            print("LESS")
            break
    else:
        print("EQUAL")

Submission status: Accepted

Solution code:
x = int(input())
x -= int(input())

if x > 0:
    print("GREATER")
elif x < 0:
    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()

if len(A) != len(B):
    if len(A) > len(B):
        print('GREATER')
    else:
        print('LESS')
else:
    for a, b in zip(A, B):
        if int(a) > int(b):
            print('GREATER')
            exit()
        elif int(a) < int(b):
            print('LESS')
            exit()
    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")