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.



Sample input:
3 8 7 1


Sample output:
Left

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c, d = (int(i) for i in input().split())
#print(a,b,c,d)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
a, b, c, d = (int(i) for i in input().split()) 
result = 'Right' if a+b < c+d else 'Left' if a+b > c+d else 'Balanced'
print (result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

l = A+B
r= C+D

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    sa = input().split(' ')
    a = [int(s) for s in sa]

    l = a[0] + a[1]
    r = a[2] + a[3]

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D = [int(i) for i in input().split()]
l = A+B
r = C+D
if (l > r) :
    print("Left")
elif (l == r) :
    print("Balanced")
else :
    print("Right")

Submission status: Accepted

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


abc083_a()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    """Function."""
    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()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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")

Submission status: Accepted

Solution code:
abcd = list(map(int, input().split()))
if abcd[0] + abcd[1] > abcd[2] + abcd[3]:
    print("Left")
elif abcd[0] + abcd[1] == abcd[2] + abcd[3]:
    print("Balanced")
else:
    print("Right")

Submission status: Accepted

Solution code:
# Libra
print((lambda x:'Left' if x[0]+x[1]>x[2]+x[3] else ('Balanced' if x[0]+x[1]==x[2]+x[3] else 'Right'))(list(map(int, input().split()))))

Submission status: Accepted

Solution code:
list = [int(i) for i in input().split()]

# print(list)
# print(list[0])

l = list[0] + list[1]
r = list[2] + list[3]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if l == r:
    answer = 'Balanced'
elif l > r:
    answer = 'Left'
else:
    answer = 'Right'

print(answer)

Submission status: Accepted

Solution code:
x =input().split()
for i in range(4): x[i] = int(x[i])
e =x[0]+x[1]
f =x[2]+x[3]
if e > f:
  print("Left")
elif e<f:
  print("Right")
else : print("Balanced")

Submission status: Accepted

Solution code:
N = list(map(int, input().split()))
if N[0]+N[1]==N[2]+N[3]:
    print('Balanced')
elif N[0]+N[1]<N[2]+N[3]:
    print('Right')
else:
    print('Left')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
print(["Balanced","Left","Right"][(C+D<A+B)-(C+D>A+B)])

Submission status: Accepted

Solution code:
A, B, C, D = map( int, input().split())
L = A + B
R = C
print(["Balanced","Left","Right"][((C+D)<(A + B)) - ((C+D)>(A + B))])

Submission status: Accepted

Solution code:
A, B, C, D = map( int, input().split())
L = A + B
R = C + D
print(["Balanced","Left","Right"][(R<L) - (R>L)])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input().strip().split(" ")
b=[int(i) for i in a]

Left=0
Right=0

Left=b[0]+b[1]
Right=b[2]+b[3]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
s = a+b
t = c+d

if s>t:
  print("Left")
elif s<t:
  print("Right")
else:
  print("Balanced")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(map(int,input().split()))

if s[0]+s[1] > s[2]+s[3]:
  print("Left")
elif s[0]+s[1] == s[2]+s[3]:
    print("Balanced")
else:
  print("Right")

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split());print(['RLiegfhtt'[a+b>c+d::2],'Balanced'][a+b==c+d])

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split());e=a+b;f=c+d;print(['RLiegfhtt'[e>f::2],'Balanced'][e==f])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Nov  4 21:46:51 2018

@author: sk
"""


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

s1=a+b
s2=c+d

if s1>s2:
  print("Left")
elif s1==s2:
  print("Balanced")
else:
  print("Right")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
l = a[0] + a[1]
r = a[2] + a[3]
if l > r:
  print("Left")
elif l == r:
  print("Balanced")
else:
  print("Right")

Submission status: Accepted

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

Submission status: Accepted

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

E = A + B - (C + D)

if E > 0:
    print('Left')
elif E < 0:
    print('Right')
else:
    print('Balanced')

Submission status: Accepted

Solution code:
A, B, C, D = [int(i) for i in input().split()]
if A + B == C + D:
    print("Balanced")
elif A + B > C + D:
    print("Left")
else:
    print("Right")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')
elif a+b==c+d:
  print('Balanced')
else:
  print('error')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z,w = map(int,input().split())
if x + y < z + w:
  print('Right')
elif x + y == z + w:
  print('Balanced')
else:
  print('Left')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, raw_input().split())

if A + B < C + D:
	print "Right"
elif A + B == C + D:
	print "Balanced"
else:
	print "Left"

Submission status: Accepted

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

if L > R:
    print('Left')

elif L == R:
    print('Balanced')

else:
    print('Right')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split());print('Balanced'if a+b==c+d else 'RLiegfhtt'[a+b>c+d::2])

Submission status: Accepted

Solution code:
a, b, c, d = [int(_) for _ in input().split()]
l = a + b
r = c + d
print('Left' if l > r else 'Right' if r > l else 'Balanced')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))

if a[0] + a[1] == a[2] + a[3]:
  print('Balanced')
elif a[0] + a[1] < a[2] + a[3]:
  print('Right')
else:
  print('Left')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
hoge = A + B
fuga = C + D

if hoge > fuga:
    print("Left")
elif hoge == fuga:
    print("Balanced")
else:
    print("Right")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c, d = [int(m) for m in input().split(" ")]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: utf-8
A, B, C, D = map(int, input().split())
print("Balanced" if A+B == C+D else "Left" if A+B > C+D else "Right")

Submission status: Accepted

Solution code:
#coding: utf-8
A, B, C, D = map(int, input().split())
print("Balanced" if A+B == C+D else ["Left","Right"][A+B < C+D])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
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')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

l = A + B
r = C + D

if l > r:
    ans = "Left"
elif l == r:
    ans = "Balanced"
else:
    ans = "Right"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# !/usr/bin/env python
# -*- coding: utf-8 -*-


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# vim: set fileencoding=utf-8:


def main():
    A, B, C, D = map(int, raw_input().split())
    l = A + B
    r = C + D

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split());print(["Left","Balanced","Right"][(a+b<c+d)+(a+b<=c+d)])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split());print(['Balanced','Left','Right'][(a+b>c+d)-(a+b<c+d)])

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
print(['Right','Left','Balanced'][(a+b>c+d)-(a+b==c+d)])

Submission status: Accepted

Solution code:
a,b,c,d = (int(_) for _ in input().split())

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

Submission status: Accepted

Solution code:
def sign(n):
    if n == 0:
        return 0
    return n // abs(n)

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

print(["Left", "Balanced", "Right"][1 - sign(A + B - C - D)])

Submission status: Accepted

Solution code:
def sign(n):
    if n == 0:
        return 0
    else:
        return n // abs(n)

A, B, C, D = map(int, input().split())
print(["Left", "Balanced", "Right"][1 - sign(A + B - C - D)])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#83a
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = list(map(int,input().split(" ")))
A = N[0]+N[1]
B = N[2]+N[3]
if A > B:
    print('Left')
elif A < B:
    print('Right')
elif A == B:
    print('Balanced')

Submission status: Accepted

Solution code:
lis =input().split()
left=int(lis[0])+int(lis[1])
right=int(lis[2])+int(lis[3])
if left>right:
    print("Left")
elif left<right:
    print("Right")
else:
    print("Balanced")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())

A,B,C,D = inpl()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math,string,itertools,fractions,heapq,collections,re,array,bisect

def ln():
    return map(int, input().split())

A,B,C,D = ln()

L = A+B
R = C+D

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
Weight = list(map(int, input().split()))
if (Weight[0] + Weight[1]) > (Weight[2] + Weight[3]):
    print("Left")
elif (Weight[0] + Weight[1]) < (Weight[2] + Weight[3]):
    print("Right")
else:
    print("Balanced")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
sgns = ('>', '==', '<')
d_sa = {
    sgn:ans
    for sgn, ans in
    zip(sgns, ('Left', 'Balanced', 'Right'))
    }
for sgn in sgns:
    f = str(a+b)+sgn+str(c+d)
    if eval(f):
        print(d_sa[sgn])
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
l = [a,b]
r = [c,d]
if sum(l) >= sum(r):
    if sum(l) == sum(r):
        print("Balanced")
    else:
        print("Left")
else:
    print("Right")

Submission status: Accepted

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