Codeforce Round #221 Div2 A

A. Lever

time limit per test 1 second

memory limit per test 256 megabytes

 

You have a description of a lever as string s. We'll represent the string length as record |s|, then the lever looks as a horizontal bar with weights of length |s| - 1 with exactly one pivot. We will assume that the bar is a segment on the Ox axis between points 0 and |s| - 1.

The decoding of the lever description is given below.

• If the i-th character of the string equals "^", that means that at coordinate i there is the pivot under the bar.
• If the i-th character of the string equals "=", that means that at coordinate i there is nothing lying on the bar.
• If the i-th character of the string equals digit c (1-9), that means that at coordinate i there is a weight of mass c on the bar.

 

Your task is, given the lever description, print if it will be in balance or not. Assume that the bar doesn't weight anything. Assume that the bar initially is in balance then all weights are simultaneously put on it. After that the bar either tilts to the left, or tilts to the right, or is in balance.

Input

The first line contains the lever description as a non-empty string s (3 ≤ |s| ≤ 10⁶), consisting of digits (1-9) and characters "^" and "=". It is guaranteed that the line contains exactly one character "^". It is guaranteed that the pivot of the lever isn't located in any end of the lever bar.

To solve the problem you may need 64-bit integer numbers. Please, do not forget to use them in your programs.

Output

Print "left" if the given lever tilts to the left, "right" if it tilts to the right and "balance", if it is in balance.

Sample test(s)

Input

=^==

Output

balance

Input

9===^==1

Output

left

Input

2==^7==

Output

right

Input

41^52==

Output

balance

Note

As you solve the problem, you may find the following link useful to better understand how a lever functions: http://en.wikipedia.org/wiki/Lever.

The pictures to the examples:

 

 

 

#pragma comment(linker,"/STACK:102400000,102400000")
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x7fffffff
#define mod 1000000007
#define ll long long
#define maxn 1000005
#define pi acos(-1.0)
int n, m;
int t;
char s[maxn];
int a[maxn];
int main(){
    scanf("%s", s);
    n = strlen(s);
    for (int i = 0; i < n; i++){
        if (s[i] == '^')t = i;
    }
    ll a=0, b=0;
    for (int i = 0; i < n; i++){
        if (s[i] == '=')continue;
        if (i < t)a += ((ll)t - (ll)i)*(s[i] - '0');
        if (i>t)b += ((ll)i - (ll)t)*(s[i] - '0');
    }
    if (a == b){ printf("balance\n"); return 0; }
    if (a < b)printf("right\n");
    else printf("left\n");
}