#include <bits/stdc++.h>
using namespace std;
int toInt(string s) {
  istringstream sin(s);
  int t;
  sin >> t;
  return t;
}
template <class T>
string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
long long toInt64(string s) {
  istringstream sin(s);
  long long t;
  sin >> t;
  return t;
}
template <class T>
T gcd(T a, T b) {
  if (a < 0) return gcd(-a, b);
  if (b < 0) return gcd(a, -b);
  return (b == 0) ? a : gcd(b, a % b);
}
long long C(long long n, long long m) {
  long long a[100], b[100];
  if (n < m) return 0;
  if (m == 0) return 1;
  if (m == 1) return n;
  for (int i = 1; i <= m; i++) {
    a[i] = n - i + 1;
    b[i] = i;
  }
  long long ans = 1;
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= m; j++) {
      long long s = gcd(a[i], b[j]);
      if (s > 1) {
        a[i] /= s;
        b[j] /= s;
      }
    }
    ans *= a[i];
  }
  return ans;
}
const int N = 105;
struct node {
  int x, p;
} d[N];
bool cmp(const node &a, const node &b) { return a.x < b.x; }
string s;
int main() {
  cin >> s;
  int n = s.length();
  int k = -1;
  for (int i = 0; i < n; i++)
    if (s[i] == '^') {
      k = i;
      break;
    }
  long long a = 0, b = 0;
  for (int i = 0; i < k; i++) {
    if (s[i] >= '0' && s[i] <= '9') {
      a += (s[i] - '0') * (k - i);
    }
  }
  for (int i = k + 1; i < n; i++) {
    if (s[i] >= '0' && s[i] <= '9') {
      b += (s[i] - '0') * (i - k);
    }
  }
  if (a == b)
    cout << "balance" << endl;
  else if (a < b)
    cout << "right" << endl;
  else
    cout << "left" << endl;
  return 0;
}
