#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <ctime>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcount(b)
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)

#define delete(a,n) a.erase(remove(all(a),n),a.end())
template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; }
template<typename T> void operator>>(vector<T>& a, int b) {while(b--)if(!a.empty())a.pop_back();}
bool isprime(int n){ if(n<2)return false;  for(int i=2;i*i<=n;i++)if(n%i==0)return false;  return true;} 
ll b_pow(ll x,ll n){return n ? b_pow(x*x,n/2)*(n%2?x:1) : 1ll;}
string itos(int n){stringstream ss;ss << n;return ss.str();}


string name[10];
int w[10];
int s[10];

vector<int> answer,current;
int used[10];
int n;
int sum = 0;
double jushin = 0 , curr = 0;
int dfs(int x){
	int chksum = 0;
	for(int i = current.size() - 1 ; i >= 0 ; i--){
		if( chksum > s[current[i]] ) return 0;
		chksum += w[current[i]];
	}
	
	if( current.size() == n ) {
		if( jushin < curr ){
			answer = current;
			curr = jushin;
		}
		return 0;
	}
	for(int i = 0 ; i < n ; i++){
		if( !used[i] ){
			used[i] = true;
			current.push_back(i);
			jushin += x * w[i];
			dfs(x+1);
			jushin -= x * w[i];
			current.pop_back();
			used[i] = false;
		}
	}
}
int main(){
	while(cin >> n && n){
		for(int i = 0 ; i < n ; i++){
			cin >> name[i] >> w[i] >> s[i];
		}
		curr = 1e9;
		answer.clear();
		dfs(1);
		for(int i = 0 ; i < n ; i++){
			cout << name[answer[i]] << endl;
		}
	}
}