Problem:
 Score : 100 points    Problem Statement A balance scale tips to the left if L>R , where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R , and tips to the right if L<R .  Takahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and placed a mass of weight C and a mass of weight D on the right pan.  Print Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.      Constraints  1\leq A,B,C,D \leq 10  All input values are integers.         Input Input is given from Standard Input in the following format:  A  B  C  D       Output Print Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.        Sample Input 1 3 8 7 1      Sample Output 1 Left  The total weight of the masses on the left pan is 11 , and the total weight of the masses on the right pan is 8 . Since 11>8 , we should print Left .       Sample Input 2 3 4 5 2      Sample Output 2 Balanced  The total weight of the masses on the left pan is 7 , and the total weight of the masses on the right pan is 7 . Since 7=7 , we should print Balanced .       Sample Input 3 1 7 6 4      Sample Output 3 Right  The total weight of the masses on the left pan is 8 , and the total weight of the masses on the right pan is 10 . Since 8<10 , we should print Right .

Solution (Python):
a,b,c,d=list(map(int, input().split()))
if a+b == c+d:
  print("Balanced")
elif a+b > c+d:
  print("Left")
else:
  print("Right")

Solution (Python):
a,b,c,d=map(int, input().split())
l = a+b
r = c+d
if l>r:
  print('Left')
elif l==r:
  print('Balanced')
else:
  print('Right')

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b>c+d:
    print("Left")
elif a+b<c+d:
    print("Right")
else:
    print("Balanced")

Solution (Python):
a,b,c,d=map(int,input().split())
left=a+b
right=c+d
if left==right:
    print('Balanced')
elif left>right:
    print('Left')
else :
    print('Right')

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b==c+d:
    print("Balanced")
elif a+b>c+d:
    print("Left")
else:
    print("Right")

Solution (Python):
a,s,d,f=map(int,input().split())
a+=s;d+=f
print("Right"if a<d else"Left"if a>d else"Balanced")

Solution (Python):

a,b,c,d=map(int,input().split())

if (a+b)>(c+d):print('Left')
elif (a+b)<(c+d):print('Right')
else:print('Balanced')

Solution (Python):
A, B, C, D = map(int, input().split())
if A+B == C+D:
  print("Balanced")
elif A+B > C+D:
  print("Left")
else:
  print("Right")

Solution (Python):
A,B,C,D = map(int,input().split())
if A+B<C+D:
    print('Right')
elif A+B==C+D:
    print('Balanced')
else:
    print('Left')

Solution (Python):
a,b,c,d=map(int,input().split())
print("Left"if a+b>c+d else "Right" if a+b<c+d else "Balanced")

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b, c, d = map(int, readline().split())
if a + b > c + d:
    print('Left')
elif a + b < c + d:
    print('Right')
else:
    print('Balanced')

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b, c, d = map(int, readline().split())
if a + b > c + d:
    print('Left')
elif a + b < c + d:
    print('Right')
else:
    print('Balanced')

Solution (Python):
a,b,c,d=map(int,input().split())
print('Left' if a+b>c+d else 'Balanced' if a+b==c+d else 'Right')

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = int(x[3])
left = a+b
right = c+d
if left > right:
  print('Left')
elif left < right:
  print('Right')
else:
  print('Balanced')

Solution (Python):
a,b,c,d=map(int,input().split())
if (a+b)>(c+d):
  print('Left')
if (a+b)==(c+d):
  print('Balanced')
if (a+b)<(c+d):
  print('Right')

Solution (Python):
A,B,C,D = map(int,input().split())

if A+B == C+D:
    print('Balanced')
elif A+B >= C+D:
    print('Left')
else:
    print('Right')

Solution (Python):
A,B,C,D = map(int,input().split())
print('Left' if (A+B)>(C+D) else 'Balanced' if (A+B) == (C+D) else 'Right')

Solution (Python):
a, b, c, d = map(int, input().split())
l, r = a + b, c + d
print('Left' if l > r else 'Balanced' if l == r else 'Right')

Solution (Python):
a, b, c, d = map(int, input().split())
diff = a + b - c - d
print("Left" if diff > 0 else "Balanced" if diff == 0 else "Right")

Solution (Python):
A, B, C, D = map(int, input().split())
if A + B < C + D:
  print('Right')
elif A + B > C + D:
  print('Left')
else:
  print('Balanced')

Solution (Python):
def main():
    A, B, C, D = map(int, input().split())
    left = A + B
    right = C + D
    ans = "Left" if left > right else "Balanced" if left == right else "Right"
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
a, s, d, f = map(int, input().split())
if a + s > d + f:
    print("Left")
elif a + s == d + f:
    print("Balanced")
else:
    print("Right")

Solution (Python):
a, b, c, d = map(int, input().split())
if a+b > c+d:
    print("Left")
elif a+b < c+d:
    print("Right")
else:
    print('Balanced')

Solution (Python):
a, b, c, d = map(int, input().split())
l = a + b
r = c + d
if l > r:
    print("Left")
elif r > l:
    print("Right")
else:
    print("Balanced")

Solution (Python):
a,b,c,d=map(int,input().split())
l=a+b
r=c+d
if l==r:
  print("Balanced")
elif r>l:
  print("Right")
else:
  print("Left")

Solution (Python):
a,b,c,d = map(int,input().split())

if a+b < c+d:
	print("Right")
elif a+b == c+d:
	print("Balanced")
else:
	print("Left")

Solution (Python):
A, B, C, D = map(int, input().split())
print('Left' if A + B > C + D else 'Balanced' if A + B == C + D else 'Right')

Solution (Python):
a, b, c, d = map(int, input().split())

if a + b > c + d:
    print('Left')
elif a + b < c + d:
    print('Right')
else:
    print('Balanced')

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b<c+d:
    print("Right")
elif a+b==c+d:
    print("Balanced")
else:
    print("Left")

Solution (Python):
a, b, c, d = list(map(int, input().split()))
if a + b < c + d:
    print('Right')
elif a + b == c + d:
    print('Balanced')
else:
    print('Left')

Solution (Python):
A, B, C, D = map(int, input().split())
print("Left" if A+B > C+D else "Balanced" if A+B == C+D else "Right")

Solution (Python):
a, b, c, d = map(int, input().split())
if a+b==c+d:
	print("Balanced")
elif a+b>c+d:
	print("Left")
else:
	print("Right")

Solution (Python):
a,b,c,d = map(int, input().split())
if a+b == c+d:
    print("Balanced")
elif a+b > c+d:
    print("Left")
else:
    print("Right")

Solution (Python):
a,b,c,d = map(int, input().split())
if a+b > c+d :
  print("Left")
elif a+b < c+d:
  print("Right")
else:
  print("Balanced")

Solution (Python):
a,b,c,d = map(int,input().split())
if a+b > c+d:
    print ("Left") 
elif a+b == c+d:
    print ("Balanced")
else: 
    print ("Right")

Solution (Python):
A, B, C, D = map(int, input().split())

if A + B > C + D:
  print("Left")
elif A + B == C + D:
  print("Balanced")
else:
  print("Right")

Solution (Python):
import collections


def inputStrOnebyOne():
    s = list(input())
    return s


def inputOnebyOne_Int():
    a = list(int(x) for x in input().split())
    return a

def main():
    a, b, c, d = map(int,input().split())
    if a+b > c+d:
        print("Left")
    elif a+b < c+d:
       print("Right")
    else:
        print("Balanced")

if __name__=='__main__':
    main()

Solution (Python):
a,b,c,d = map(int, input().split())

if a+b > c+d:
  print("Left")
elif a+b < c+d:
  print("Right")
else:
  print("Balanced")

Solution (Python):

A, B, C, D = map(int, input().split())
L = A + B
R = C + D
print('Left' if L > R else 'Right' if L < R else 'Balanced')

Solution (Python):
a, b, c, d = map(int, input().split())

l = a + b
r = c + d

if l < r:
    print('Right')
elif l > r:
    print('Left')
else:
    print('Balanced')

Solution (Python):

"""
Created on Thu May 14 01:14:08 2020

@author: shinba
"""

a,b,c,d = map(int,input().split())

if a+b > c+d:
    print("Left")
elif a+b < c+d:
    print("Right")
else:
    print("Balanced")

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b>c+d:
  print('Left')
elif (a+b)==(c+d):
  print('Balanced')
else:
  print('Right')

Solution (Python):

import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b,c,d=map(int, input().split())
    x=a+b
    y=c+d
    if x>y:
        print('Left')
    elif x==y:
        print('Balanced')
    else:
        print('Right')
resolve()

Solution (Python):
a, b, c, d = map(int, input().split())
if a + b > c + d:
    print('Left')
elif a + b == c + d:
    print('Balanced')
else:
    print('Right')

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





A,B,C,D = inputIL()

if A+B == C+D:
  print("Balanced")
elif A+B>C+D:
  print("Left")
else:
  print("Right")

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b<c+d:
  print("Right")
elif a+b>c+d:
  print("Left")
else:
  print("Balanced")

Solution (Python):
a, b, c, d = map(int, input().split())
if a + b > c + d:
    print('Left')
elif a + b < c + d:
    print('Right')
else:
    print('Balanced')

Solution (Python):
import sys
import math
import bisect

def main():
    a, b, c, d = map(int, input().split())
    if a + b > c + d:
        print('Left')
    elif a + b < c + d:
        print('Right') 
    else:
        print('Balanced')

if __name__ == "__main__":
    main()

Solution (Python):
a,b,c,d=map(int,input().split())
print("Left"if a+b>c+d else "Balanced"if a+b==c+d else "Right")

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    a,b,c,d=map(int,input().split())
    if a+b>c+d:
        print('Left')
    elif a+b==c+d:
        print('Balanced')
    else:
        print('Right')

if __name__ == '__main__':
    main()

Solution (Python):
a,b,c,d = map(int,input().split())
if a+b > c+d:
    print('Left')
elif a+b == c+d:
    print('Balanced')
else:
    print('Right')

Solution (Python):
A,B,C,D=map(int,input().split())
if (A+B>C+D):
    print ("Left")
elif (A+B==C+D):
    print ("Balanced")
elif (A+B<C+D):
    print ("Right")

Solution (Python):
A,B,C,D = map(int, input().split())
if (A+B) == (C+D):
    print("Balanced")
elif (A+B) > (C+D):
    print("Left")
else:
    print("Right")

Solution (Python):
A,B,C,D = map(int, input().split())




L = A + B
R = C + D
print("Left" if L > R else "Balanced" if L == R else "Right")

Solution (Python):
A,B,C,D = list(map(int,input().split()))
if A+B < C+D:
    print("Right")
elif A+B > C+D:
    print("Left")
else:
    print("Balanced")

Solution (Python):
a,b,c,d = map(int,input().split())
if a+b < c+d:
  print("Right")
elif a+b > c+d:
  print("Left")
else:
  print("Balanced")

Solution (Python):
a, b, c, d = map(int, input().split())
if a + b > c + d:
    print("Left")
elif a + b == c + d:
    print("Balanced")
else:
    print("Right")

Solution (Python):
def resolve():
	a, b, c, d = map(int, input().split())
	l = a + b
	r = c + d
	if l == r:
		print('Balanced')
	elif l > r:
		print('Left')
	else:
		print('Right')
resolve()

Solution (Python):
a,b,c,d = map(int, input().split())

if a+b == c+d:
    print('Balanced')
elif a+b < c+d:
    print('Right')
else:
    print('Left')

Solution (Python):
a, b, c, d = map(int, input().split())
l = a + b
r = c + d
if l > r:
    print('Left')
elif l < r:
    print('Right')
else:
    print('Balanced')

Solution (Python):
A, B, C, D = list(map(int, input().split()))
l = A+B
r = C+D
if l > r:
    ans = "Left"
elif l < r:
    ans = "Right"
else:
    ans = "Balanced"
print(ans)

Solution (Python):
def ABC_83_A():
    A,B,C,D = map(int, input().split())
    
    if A+B>C+D:
        print('Left')
    elif A+B==C+D:
        print('Balanced')
    else:
        print('Right')

if __name__ == '__main__':

    ABC_83_A()

Solution (Python):
A,B,C,D = map(int,input().split())

L = A + B
R = C + D
if L > R:
    print('Left')
elif L < R:
    print('Right')
elif L == R:
    print('Balanced')

Solution (Python):
A,B,C,D=map(int,input().split())
if A+B==C+D: print('Balanced')
else: print('Left' if A+B > C+D else 'Right')

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    A, B, C, D = map(int, input().split())

    if A + B > C + D:
        ans = "Left"
    elif A + B == C + D:
        ans = "Balanced"
    else:
        ans = "Right"

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
a,b,c,d = map(int,input().split())
if a+b > c+d:
    print("Left")
elif a+b < c+d:
    print("Right")
else:
    print("Balanced")

Solution (Python):

import sys


input = sys.stdin.readline
def IS(cb): return cb(input().strip())
def IL(cb): return [cb(s) for s in input().strip().split()]
def IR(cb, rows): return [IS(cb) for _ in range(rows)]
def ILL(cb, rows): return [IL(cb) for _ in range(rows)]


def solve():
    A, B, C, D = IL(int)
    if A + B > C + D:
        print('Left')
    elif A + B == C + D:
        print('Balanced')
    else:
        print('Right')


solve()

Solution (Python):
A, B, C, D = map(int, input().split())
left = A + B
right = C + D
if left < right:
    print("Right")
elif left > right:
    print("Left")
else:
    print("Balanced")

Solution (Python):
a,b,c,d=map(int,input().split())
if (a+b)<(c+d):
  print("Right")
elif a+b==c+d:
  print("Balanced")
else:
  print("Left")

Solution (Python):
def main():
    a,b,c,d = (int(x) for x in input().split())
    if a+b == c+d: print('Balanced')
    elif a+b > c+d: print('Left')
    else: print('Right')

if __name__ == '__main__':
    main()

Solution (Python):
a,b,c,d = map(int,input().split())
print("Left" if a+b>c+d else "Right" if a+b<c+d else "Balanced")

Solution (Python):
A, B, C, D = list(map(int,input().split()))
if A+B == C+D:
    print('Balanced')
elif A+B > C+D:
    print('Left')
else:
    print('Right')

Solution (Python):
A, B, C, D = list(map(int,input().split()))
if A+B > C+D:
    print('Left')
elif A+B < C+D:
    print('Right')
else:
    print('Balanced')

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

A, B, C, D = ri_()
print('Balanced' if A + B == C + D else 'Left' if A + B > C + D else 'Right')

Solution (Python):
A, B, C, D = map(int, input().split())
print('Left' if A+B > C+D else 'Balanced' if A+B == C+D else 'Right')

Solution (Python):
a,b,c,d = map(int,input().split())
l = a + b
r = c + d
if l > r:
    print("Left")
elif l == r:
    print("Balanced")
else:
    print("Right")

Solution (Python):
a,b,c,d=map(int,input().split())
a+=b;c+=d
if a==c:print("Balanced")
if a>c:print("Left")
if c>a:print("Right")

Solution (Python):
a,b,c,d = map(int,input().split())
if (a+b)<(c+d):
    print('Right')
elif (a+b)>(c+d):
    print('Left')
else:
    print('Balanced')

Solution (Python):
A,B,C,D = (int(i) for i in input().split())

x = A + B
y = C + D

if x > y:
    print('Left')
elif x < y:
    print('Right')
else:
    print('Balanced')

Solution (Python):
a,b,c,d=map(int,input().split())

if a+b > c+d:
    print("Left")
elif a+b == c+d:
    print("Balanced")
else:
    print("Right")

Solution (Python):
a,b,c,d=map(int,input().split())
print("Left" if a+b>c+d else "Balanced" if a+b==c+d else "Right")

Solution (Python):
a,b,c,d=map(int,input().split())
e=a+b
f=c+d
if e>f:
    print("Left")
elif e==f:
    print("Balanced")
else:
    print("Right")

Solution (Python):
A, B, C, D = map(int, input().split())

if (A + B) > (C + D):
    print("Left")
elif (A + B) == (C + D):
    print("Balanced")
else:
    print("Right")

Solution (Python):
A,B,C,D=map(int,input().split())
if A+B>C+D:
    print("Left")
elif A+B==C+D:
    print("Balanced")
else:
    print("Right")

Solution (Python):
A,B,C,D=map(int,input().split())
print("Left" if A+B > C+D else "Balanced" if A+B == C+D else "Right")

Solution (Python):
a,b,c,d=map(int,input().split())
print("Left" if a+b>c+d else "Balanced" if a+b==c+d else "Right")

Solution (Python):
A, B, C, D = map(int, input().split())

print("Left" if (A+B)>(C+D) else "Balanced" if (A+B)==(C+D) else "Right")

Solution (Python):
a, b, c, d = map(int, input().split())
if a + b > c + d:
  print('Left')
elif a + b == c + d:
  print('Balanced')
else:
  print('Right')

Solution (Python):
a,b,c,d=map(int,input().split())
left=a+b
right=c+d
if left==right:
    print('Balanced')
elif left>right:
    print('Left')
else:
    print('Right')

Solution (Python):
def libra(l,r):
    if l>r:
        return "Left"
    elif l == r:
        return "Balanced"
    else:
        return "Right"
def sum(a,b):
    c = a+b
    return c
a,b,c,d=[int(i) for i in input().split()]
print(libra(sum(a,b),sum(c,d)))

Solution (Python):
def libra(l,r):
    if l>r:
        return "Left"
    elif l==r:
        return "Balanced"
    else:
        return "Right"
def sum(a,b):
    return a+b
    
a,b,c,d=[int(_) for _ in input().split()]
print(libra(sum(a,b),sum(c,d)))

Solution (Python):
a,b,c,d = map(int,input().split())
if a+b > c+d:
    print('Left')
elif a+b == c+d:
    print('Balanced')
else:
    print('Right')

Solution (Python):
a, b, c, d = map(int, input().split())
if a + b < c + d:
  print('Right')
elif a + b == c + d:
  print('Balanced')
else:
  print('Left')

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b==c+d:
    print("Balanced")
elif a+b>c+d:
    print("Left")
else:
    print("Right")

Solution (Python):
a,b,c,d=list(map(int,input().split()))
if a + b > c + d:
  print("Left")
elif a + b == c + d:
  print("Balanced")
else:
  print("Right")

Solution (Python):
a,b,c,d = map(int, input().split())
L = a+b
R = c+d
if L > R:
  print('Left')
elif R > L:
  print('Right')
else:
  print('Balanced')

Solution (Python):


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

if A+B > C+D:
    print("Left")
elif A+B == C+D:
    print("Balanced")
else:
    print("Right")

Solution (Python):
a, b, c, d = map(int, input().split())
print("Left" if (a+b) > (c+d) else "Right" if (a+b) < (c+d) else "Balanced")

Solution (Python):
A, B, C, D = map(int, input().split())
print("Left" if A+B>C+D else "Balanced" if A+B==C+D else"Right")

Solution (Python):
A,B,C,D=map(int,input().split())
if A+B>C+D:
    print("Left")
elif A+B<C+D:
    print("Right")
else:
    print("Balanced")

Solution (Python):
a, b, c, d = map(int, input().split())

L = a + b
R = c + d

if L > R:
    print("Left")
elif L == R:
    print("Balanced")
else:
    print("Right")

Solution (Python):
a, b, c, d = map(int, input().split())

print('Left' if a + b > c + d else ('Balanced' if a + b == c + d else 'Right'))

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b==c+d:
    print("Balanced")
elif a+b<c+d:
    print("Right")
else:
    print("Left")

Solution (Python):
A, B, C, D = map(int, input().split())
print("Left" if A+B > C+D else "Balanced" if A+B == C+D else "Right")

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b==c+d:
  print('Balanced')
elif a+b>c+d:
  print('Left')
else:
  print('Right')

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop

import collections

a,b,c,d= map(int,input().split())
e = a + b
f= c + d
if e > f:
    print("Left")
elif e == f:
    print("Balanced")
else:
    print("Right")

Solution (Python):
a, b, c, d = list(map(int, input().split()))
if a + b == c + d:
    print('Balanced')
    exit()
print('Left') if a + b > c + d else print('Right')

Solution (Python):
a, b, c, d = map(int, input().split())
if a+b > c+d:
  print("Left")
elif a+b < c+d:
  print("Right")
else:
  print("Balanced")

Solution (Python):
A,B,C,D = map(int,input().split())

if A+B > C+D:
  print('Left')
elif A+B == C+D:
  print('Balanced')
else:
  print('Right')

Solution (Python):
a,b,c,d = map(int,input().split())

l = a + b
r = c + d

if l > r:
  print('Left')
elif l == r:
  print('Balanced')
else:
  print('Right')

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C, D = MAP()
if A+B > C+D:
	print("Left")
elif A+B == C+D:
	print("Balanced")
else:
	print("Right")

Solution (Python):
A, B, C, D = map(int, input().split())

L = A+B
R = C+D

if L > R:
    print('Left')
elif L == R:
    print('Balanced')
else:
    print('Right')

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b>c+d:
  print("Left")
elif a+b==c+d:
  print("Balanced")
else:
  print("Right")

Solution (Python):
a,b,c,d=map(int,input().split())
print("Balanced" if a+b==c+d else "Left" if a+b>c+d else "Right")

Solution (Python):
a,b,c,d=map(int,input().split())
print("Left" if a+b>c+d else "Right" if a+b<c+d else "Balanced")

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

INIT_VAL = 0
def DD2(d1,d2): return [[INIT_VAL]*d2 for _ in range(d1)]
def DD3(d1,d2,d3): return [DD2(d2,d3) for _ in range(d1)]

MOD=10**9+7
def divc(x,y): return -(-x//y)
def divf(x,y): return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers"""
    is_prime = [True] * MAX_NUM
    is_prime[0] = False
    is_prime[1] = False
    primes = []
    for i in range(MAX_NUM):
        if is_prime[i]:
            primes.append(i)
            for j in range(2*i, MAX_NUM, i):
                is_prime[j] = False
    return primes

from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left



def main():
    a, b, c, d = MII()
    if a+b>c+d: print('Left')
    elif a+b<c+d: print('Right')
    else: print('Balanced')

if __name__ == '__main__':
    main()

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = int(x[3])
left = a+b
right = c+d
if left > right:
  print('Left')
elif left < right:
  print('Right')
else:
  print('Balanced')

Solution (Python):
a, b, c, d = [int(i) for i in input().split()]
if a+b > c+d:
  print("Left")
elif a+b < c+d:
  print("Right")
else:
  print("Balanced")

Solution (Python):
a,b,c,d=map(int, input().split())
if a+b > c+d:
 print("Left")
elif a+b < c+d:
 print("Right")
else: 
 print("Balanced")

Solution (Python):
a,b,c,d = map(int, input().split())
l = a + b
r = c + d
if l<r:print('Right')
elif l>r: print('Left')
else:print('Balanced')

Solution (Python):
a,b,c,d = map(int, input().split())
if a+b > c+d:
  print("Left")
elif a+b == c+d:
  print("Balanced")
else:
  print("Right")

Solution (Python):


a, b, c, d = map(int, input().split())
if a + b > c + d:
    print('Left')
elif a + b < c + d:
    print('Right')
else:
    print('Balanced')

Solution (Python):
a, b, c, d = map(int, input().split())

l = a + b
r = c + d

if l == r:
    print("Balanced")
elif l > r:
    print("Left")
else:
    print("Right")

Solution (Python):
A, B, C, D = map(int, input().split())
L = A + B
R = C + D
if L > R:
  print("Left")
elif R > L:
  print("Right")
else:
  print("Balanced")

Solution (Python):
a,b,c,d = map(int, input().split())
if (a+b > c+d):
    print("Left")
elif (a+b == c+d):
    print("Balanced")
else:
    print("Right")

Solution (Python):
a, b, c, d = map(int, input().split())
if a + b > c + d:
    print('Left')
elif a + b < c + d:
    print('Right')
else:
    print('Balanced')

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b>c+d:
    print("Left")
elif a+b==c+d:
    print("Balanced")
else:
    print("Right")

Solution (Python):
A,B,C,D = map(int,input().split())
L = A+B
R = C+D

if L>R:
    print("Left")
elif L == R:
    print("Balanced")
elif L<R:
    print("Right")

Solution (Python):
a,b,c,d=map(int,input().split())
if (a+b)>(c+d):
    print("Left")
elif (a+b)<(c+d):
    print("Right")
else:
    print("Balanced")

Solution (Python):
a,b,c,d = map(int,input().split())
a+=b
c+=d
print('Balanced' if a==c else ('Left' if a>c else 'Right'))

Solution (Python):
a, b, c, d = map(int, input().split())
ans = "Left" if a+b > c+d else "Balanced" if a+b == c+d else "Right"
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque

from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi

from copy import deepcopy
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [LI()for i in range(n)]
inf = 10**17
mod = 10**9 + 7

a,b,c,d=MI()
L=a+b
R=c+d
if L>R:
    print("Left")
elif L==R:
    print("Balanced")
else:
    print("Right")

Solution (Python):
A, B, C, D = map(int, input().split())
if A+B > C+D:
  print("Left")
if A+B == C+D:
  print("Balanced")
if A+B < C+D:
  print("Right")

Solution (Python):
A,B,C,D=map(int,input().split())
if A+B>C+D:
  print("Left")
elif A+B<C+D:
  print("Right")
else:
  print("Balanced")

Solution (Python):
A,B,C,D=map(int,input().split())
e=A+B-C-D
print("Balanced")if e==0else print(["","Left","Right"][int(e/abs(e))])

Solution (Python):
A,B,C,D=map(int,input().split())
e=A+B-C-D
print("Balanced")if e==0 else print(["","Left","Right"][int(e/abs(e))])

Solution (Python):
a,b,c,d=[int(i)for i in input().split()]
if (a+b)>(c+d):
  print('Left')
elif (a+b)==(c+d):
  print('Balanced')
else:
  print('Right')

Solution (Python):
a,b,c,d = map(int, input().split())
if a+b < c+d:
  print('Right')
elif a+b == c+d:
  print('Balanced')
else:
  print('Left')

Solution (Python):
A, B , C , D = map(int, input().split())
apple = A + B
dell = C + D
if dell > apple:
    print("Right")
elif dell < apple:
    print("Left")
else:
    print("Balanced")

Solution (Python):
A,B,C,D = map(int,input().split())
l = A + B
r = C + D
if l < r:
    print('Right')
elif l == r:
    print('Balanced')
else:
    print('Left')

Solution (Python):
a, b, c, d = map(int, input().split())
if a+b > c+d:
    print('Left')
elif a+b == c+d:
    print('Balanced')
else:
    print('Right')

Solution (Python):
a, b, c, d = map(int, input().split())
if a + b > c + d:
  print('Left')
elif a + b == c + d:
  print('Balanced')
else:
  print('Right')

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b==c+d:
  print("Balanced")
elif a+b>c+d:
  print("Left")
else:
  print("Right")

Solution (Python):
a, b, c, d = map(int, input().split())
L = a+b
R = c+d
if L > R:
    print('Left')
elif L < R:
    print('Right')
else:
    print('Balanced')

Solution (Python):
a, b, c, d = map(int, input().split())
if a+b > c+d:
    print('Left')
elif a+b < c+d:
    print('Right')

else:
    print('Balanced')

Solution (Python):
a,b,c,d=list(map(int,input().split()))
x=a+b
y=c+d
if x>y:
  print("Left")
elif x<y:
  print("Right")
else:
  print("Balanced")

Solution (Python):
A, B, C, D = map(int, input().split())
left = A + B
right = C + D
if left > right:
    print('Left')
elif right > left:
    print('Right')
else:
    print('Balanced')

Solution (Python):
A,B,C,D=map(int,input().split())

print("Left" if A+B>C+D else "Right" if A+B<C+D else "Balanced")

Solution (Python):
a,b,c,d=map(int,input().split())
print("Left" if (a+b)>(c+d) else "Right" if (a+b)<(c+d) else "Balanced")

Solution (Python):
A, B, C, D = map(int,input().split())
L = A + B
R = C + D
if L > R:
    print('Left')
elif L == R:
    print('Balanced')
else:
    print('Right')

Solution (Python):
a,b,c,d=map(int, input().split())
if a+b>c+d:
  print('Left')
elif a+b==c+d:
  print('Balanced')
else:
  print('Right')

Solution (Python):
A,B,C,D=map(int,input().split())

if (A+B)>(C+D):
  print('Left')
  
elif (A+B)==(C+D):
  print('Balanced')
  
else:
  print('Right')

Solution (Python):
a,b,c,d = map(int,input().split())
print("Left" if a+b>c+d else "Balanced" if
     a+b==c+d else"Right")

Solution (Python):
a,b,c,d=map(int,input().split())
if (a+b)>(c+d):
    print("Left")
elif (a+b)<(c+d):
    print("Right")
else:
    print("Balanced")

Solution (Python):
a, b, c, d = map(int,input().split())
if a+b > c+d:
  print("Left")
if a+b < c+d:
  print("Right")
if a+b == c+d:
  print("Balanced")