// 基本テンプレート
 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
 
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;
 
struct Elem {
    string name;
    int weight, limit;
};

signed main() {
    int N;
    while(cin >> N, N) {
        vector<Elem> elems;
        for(int i=0; i<N; i++) {
            string name; int weight, limit;
            cin >> name >> weight >> limit;
            elems.push_back(Elem{name, weight, limit});
        }

        vector<int> perm(N);
        iota(perm.begin(), perm.end(), 0);

        double g = INF;
        vector<Elem> ans;
        do {
            vector<Elem> cur;
            for(int i=0; i<N; i++) cur.push_back(elems[ perm[i] ]);

            int sum = 0, ok = true, weighted_sum = 0;
            for(int i=N-1; i>=0; i--) {
                if(cur[i].limit < sum) ok = false;
                sum += cur[i].weight;
                weighted_sum += (i+1) * cur[i].weight;
            }

            double tmp_g = 1.0 * weighted_sum / sum;
            if(ok and g > tmp_g) {
                g = tmp_g;
                ans = cur;
            }
        }while(next_permutation(perm.begin(), perm.end()));
    
        for(int i=0; i<ans.size(); i++) {
            cout << ans[i].name << endl;
        }
    }
    return 0;
}
