import std.algorithm;
import std.array;
import std.ascii;
import std.bigint;
import std.complex;
import std.container;
import std.conv;
import std.functional;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

auto readInts() {
	return array(map!(to!int)(readln().strip().split()));
}
auto readInt() {
	return readInts()[0];
}
auto readLongs() {
	return array(map!(to!long)(readln().strip().split()));
}
auto readLong() {
	return readLongs()[0];
}

void readlnTo(T...)(ref T t) {
    auto s = readln().split();
    assert(s.length == t.length);
    foreach(ref ti; t) {
        ti = s[0].to!(typeof(ti));
        s = s[1..$];
    }
}

const real eps = 1e-10;


void main(){
    while(true) {
        auto n = readInt();
        if(n == 0) {
            return;
        }
        string[] f;
        int[] w, s;
        foreach(i; iota(n)) {
            auto l = readln().chomp().split(" ");
            f ~= l[0];
            w ~= l[1].to!int;
            s ~= l[2].to!int;
        }

        zip(w, s, f).sort;
        auto sf = w.sum;
        int ans[];
        while(ans.length < n) {
            foreach_reverse(j; iota(n)) {
                if(ans.canFind(j)) {
                    continue;
                }

                if(sf - w[j] <= s[j]) {
                    ans ~= j;
                    sf -= w[j];
                    break;
                }
            }
        }
        ans.each!(a => writeln(f[a]));
    }
}