#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>

#define INF 1000000000000
#define MOD 1000000007 //10^9+7:合同式の法

using namespace std;
typedef long long ll;

//マクロ
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)

int main(){
    int A,B,C,D;
    cin >> A >> B >> C >> D;

    if(A + B > C + D)
        cout << "Left" << endl;
    else if(A + B == C + D)
        cout << "Balanced" << endl;
    else
        cout << "Right" << endl;






}
#include <stdio.h>

int main (){
	int baris,kolom,warna,x;
	
	scanf ("%d",&baris);
	scanf ("%d",&kolom);
	scanf ("%d",&warna);
	
	if (baris > kolom){
        x = (warna - 1)/baris +1;
    }
    else {
        x = (warna - 1)/kolom +1;
    }
    
	printf ("%d",x);
	
	return 0;
}