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 = map(int, input().split())
l = a + b
r = c + d
ans = ''
if l == r:
    ans = 'Balanced'
elif l > r:
    ans = 'Left'
else:
    ans = 'Right'
print(ans)

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

Solution (Python):
a,b,c,d=map(int,input().split())
if a+b<c+d:
    print('Right')
elif a+b==c+d:
    print('Balanced')
elif a+b>c+d:
    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())
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):


weights = list(map(int, input().split()))
left = weights[0] + weights[1]
right = weights[2] + weights[3]

if left > right:
    print('Left')
elif right > left:
    print('Right')
else:
    print('Balanced')

Solution (Python):

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





 
def main():
    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")
	
if __name__ == "__main__":
	main()

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")

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 = 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 = [int(i) for i in 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())
left = A + B
right = C + D
if left > right:
    print('Left')
elif left == right:
    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):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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



sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C, D = MAP()
left = A + B
right = C + D
if left > right:
    print("Left")
elif left == right:
    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())
s=a+b-c-d
print('Balanced' if s==0 else 'RLiegfhtt'[s>0::2])

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 = list(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
ans = None
if left == right:
    ans = 'Balanced'
elif left > right:
    ans = 'Left'
elif left < right:
    ans = 'Right'
print(ans)

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 = [int(e) for e 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("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('Right')
else:
	print('Balanced')

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

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("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")
elif 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("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("Right")
elif a+b>c+d: print("Left")
else: print("Balanced")

Solution (Python):
a,b,c,d=(int(i) for i in 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):
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())

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('Balanced')    
elif (A + B) > (C + D):
    print('Left')    
else:
    print('Right')

Solution (Python):
A,B,C,D=(int(i) for i in 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 = [int(i) for i in input().split()]
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")
elif A + B < C + D:
    print("Right")
else:
    print("Balanced")

Solution (Python):
import sys

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    a, b, c, d = map(int, input().split())

    left = a + b
    right = c + d

    if left > right:
        print("Left")
    elif left == right:
        print("Balanced")
    else:
        print("Right")

Solution (Python):
d = list(map(int, input().split()))
if sum(d[:2]) < sum(d[2:]):
    print("Right")
elif sum(d[:2]) == sum(d[2:]):
    print("Balanced")
else:
    print("Left")

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')

Solution (Python):
a=list(map(int,input().split()))
if a[0]+a[1]<a[2]+a[3]:
  print("Right")
elif a[0]+a[1]==a[2]+a[3]:
  print("Balanced")
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('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 = list(map(int,input().split()))
b = a[0]+a[1]
c = a[2]+a[3]

if b == c:
  print("Balanced")
elif b < c:
  print("Right")
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):

import sys


def solve(A: int, B: int, C: int, D: int):
    left = A + B
    right = C + D

    if left > right:
        print('Left')
    elif left == right:
        print('Balanced')
    elif left < right:
        print('Right')

    return


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


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

Solution (Python):

A,B,C,D = map(int,input().split())
ans= (A+B)-(C+D)
if ans>0:
    print("Left")
elif ans==0:
    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 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("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("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("Right")
else:
    print("Balanced")

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

A, B, C, D = nl()

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

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())
A = A+B
C = C+D
if A == C:
  print('Balanced')
elif A < C:
  print('Right')
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("Right")
else:
    print("Left")

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('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):
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):
inp = input().split()
a = int(inp[0])
b = int(inp[1])
c = int(inp[2])
d = int(inp[3])


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):

import sys


def solve(A: int, B: int, C: int, D: int):
    L = A + B
    R = C + D

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



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

if __name__ == '__main__':
    main()

Solution (Python):
a1,a2,b1,b2 = map(int, input().split())
a = a1+a2
b = b1+b2
print('Left' if a>b else ('Balanced' if a==b 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("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):
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):
aa = list(map(int,input().split()))
bb = ["Left","Right","Balanced"]
a,b,c,d = [i for i in aa]

if a + b > c +d:
    print(bb[0] )
if a + b < c +d:
    print(bb[1] )
if a + b == c +d:
    print(bb[2] )

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

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())
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=list(map(int,input().split()))
a=sum(A[:2])
b=sum(A[2:])
if a > b:
    print('Left')
elif a < b:
    print('Right')
else:
    print('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("Balanced")
elif A+B > C+D :
    print("Left")
else :
    print("Right")

Solution (Python):
a,b,c,d = map(int,input().split())
A = a + b
C = c + d
if A < C:
	print("Right")
elif A > C:
	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):
a, b, c, d = map(int, input().split())
res = (a + b) - (c + d)

if res == 0:
  print("Balanced")
elif res > 0:
  print("Left")
else:
  print("Right")

Solution (Python):
def abc():
    a, b, c, d = map(int, input().split())
    l = a + b
    r = c + d

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


abc()

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('Right')
else:
  print('Balanced')

Solution (Python):
A, B, C, D = map(int, input().split())
if (A + B) < (C + D):
    print("Right")
elif (C + D) < (A + B):
    print("Left")
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 = [int(x) for x in input().split()]
if A + B < C + D:
  print("Right")
elif A + B > C + D:
  print("Left")
elif A + B == C + D:
  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('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):
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 ('Right')
elif L > R:
  print ('Left')
else:
  print ('Balanced')

Solution (Python):
A, B, C, D = [int(x) for x in input().split()]
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")
elif a+b < c+d:
  	print("Right")
else:
  	print("Balanced")

Solution (Python):
A,B,C,D=input().split()
a=int(A)
b=int(B)
c=int(C)
d=int(D)
x=a+b
y=c+d
if x>y:
  print('Left')
elif x<y:
  print('Right')
else:
  print('Balanced')

Solution (Python):
import math

def main():
    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')

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


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


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

if __name__ == '__main__':
    main()

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):











import sys
input=sys.stdin.readline
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [input() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    a, b, c, d = MI()
    left = a + b
    right = c + d
    if left > right:
        print("Left")
    elif left < right:
        print("Right")
    else:
        print("Balanced")
if __name__ == '__main__':
    main()

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

if ab == cd :
    print("Balanced")
elif ab>cd:
    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('Balanced')
elif l > r:
    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 = [int(i) for i in input().split()]
E = A + B - C - D
if E > 0:
    print("Left")
elif E == 0:
    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 = [ int(v) for v 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("Right")
elif a + b > c + d:
    print("Left")
else:
    print("Balanced")

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

left = A + B
right = C + D

if left > right:
    print('Left')
elif left < right:
    print('Right')
elif left == right:
    print('Balanced')

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

ans1 = a+b
ans2 = c+d

if ans1 > ans2:
    print("Left")
elif ans1 < ans2:
    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())
left=a+b
right=c+d

if left>right:
    print("Left")

elif left==right:
    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())
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 = 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())
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().rstrip().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())
print('%s' % '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):
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):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    a, b, c, d = (int(_) for _ in 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):

import sys
input = sys.stdin.readline

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)

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 = [ int(it) for it 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("Left")
elif a+b<c+d:
  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())


ans = 'Balanced' if a+b==c+d else 'Left' if a+b>c+d else 'Right'

print(ans)

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

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("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 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())
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())
l = a+b
r = c+d
if l==r:
    print("Balanced")
if l<r:
    print("Right")
if l>r:
    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):

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')


def A():
    a, b, c, d = LI()
    a += b
    c += d
    ans = ["Left", "Right"]
    if a == c:
        print("Balanced")
        return
    print(ans[a < c])
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

Solution (Python):


import math

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):
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):

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

L = sum(l[:2])
R = sum(l[2:])

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

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

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

Solution (Python):
import sys


def input():
    return sys.stdin.readline()[:-1]








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 :
  ans = "Balanced"
elif l > r :
  ans = "Left"
else :
  ans = "Right"
print(ans)

Solution (Python):
A,B,C,D = map(int,input().split(' '))
X = A + B
Y = C + D
if X == Y:
  print('Balanced')
elif X > Y:
  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("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):
M=[int(i) for i in input().split()]
if M[0]+M[1]<M[2]+M[3]:
    print('Right')
elif M[0]+M[1]>M[2]+M[3]:
    print('Left')
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("Left")
elif a+b<c+d:
    print("Right")
else:
    print("Balanced")