#include <bits/stdc++.h>
using namespace std;
struct TreeNode {
    int left, right;
};
vector<TreeNode> tree;
int cw(int node) {
    if (node == -1 || node < 1 || node > tree.size() - 1) return 0;
    return 1 + cw(tree[node].left) + cw(tree[node].right);
}
signed main() {
    int n;
    cin >> n;
    tree.resize(n + 1);
    for (int i = 1; i <= n; ++i) {
        cin >> tree[i].left >> tree[i].right;
        if (tree[i].left < 1 || tree[i].left > n) tree[i].left = -1;
        if (tree[i].right < 1 || tree[i].right > n) tree[i].right = -1;
    }
    int lw = cw(tree[1].left);
    int rw = cw(tree[1].right);
    if (lw > rw) {
        cout << "left" << endl;
    } else if (lw < rw) {
        cout << "right" << endl;
    } else {
        cout << "balance" << endl;
    }
    return 0;
}