#include <bits/stdc++.h>   using namespace std;   string s;   void solve() {     long long n = s.length(), i, j, k;     long long piv = 0;     for (i = 0; i < n; i++)       if (s[i] ==  ^ ) {         piv = i;         break;       }     long long l = piv;     long long r = n - piv - 1;     long long c1 = 0, c2 = 0;     for (i = 0; i < l; i++) {       if (s[i] ==  = ) continue;       j = (piv - i) * (s[i] -  0 );       c1 += j;     }     for (i = piv + 1; i < n; i++) {       if (s[i] ==  = ) continue;       j = (i - piv) * (s[i] -  0 );       c2 += j;     }     if (c1 == c2) cout <<  balance n ;     if (c1 > c2) cout <<  left n ;     if (c1 < c2) cout <<  right n ;   }   int main(int argc, char const *argv[]) {     cin >> s;     solve();     return 0;   }   