#include <cstdio>

 #include <cstring>

 #include <cstdlib>

 #include <cmath>

 #include <deque>

 #include <vector>

 #include <queue>

 #include <iostream>

 #include <algorithm>

 #include <map>

 #include <set>

 #include <ctime>

 using namespace std;

 typedef long long LL;

 typedef double DB;

 #define For(i, s, t) for(int i = (s); i <= (t); i++)

 #define Ford(i, s, t) for(int i = (s); i >= (t); i--)

 #define Rep(i, t) for(int i = (0); i < (t); i++)

 #define Repn(i, t) for(int i = ((t)-1); i >= (0); i--)

 #define rep(i, x, t) for(int i = (x); i < (t); i++)

 #define MIT (2147483647)

 #define INF (1000000001)

 #define MLL (1000000000000000001LL)

 #define sz(x) ((int) (x).size())

 #define clr(x, y) memset(x, y, sizeof(x))

 #define puf push_front

 #define pub push_back

 #define pof pop_front

 #define pob pop_back

 #define ft first

 #define sd second

 #define mk make_pair

 inline void SetIO(string Name) {

     string Input = Name+".in",

     Output = Name+".out";

     freopen(Input.c_str(), "r", stdin),

     freopen(Output.c_str(), "w", stdout);

 }

 inline int Getint() {

     int Ret = ;

     char Ch = ' ';

     while(!(Ch >= '' && Ch <= '')) Ch = getchar();

     while(Ch >= '' && Ch <= '') {

         Ret = Ret*+Ch-'';

         Ch = getchar();

     }

     return Ret;

 }

 const int N = ;

 struct JediType {

     string Name;

     int a, b, c;

     inline void Read() {

         cin>>Name;

         scanf("%d%d%d", &a, &b, &c);

     }

     inline bool operator >(const JediType &T) const {

         return ((a >= T.a)+(b >= T.b)+(c >= T.c)) >= ;

     }

 } Jedi[N];

 int n;

 bool F[N][N];

 inline void Input() {

     scanf("%d", &n);

     For(i, , n) Jedi[i].Read();

 }

 inline void Solve() {

     For(i, , n)

         For(j, , n)

             if(Jedi[i] > Jedi[j])

                 F[i][j] = ;

     For(k, , n)

         For(i, , n)

             For(j, , n)

                 F[i][j] |= F[i][k]&F[k][j];

     For(i, , n) {

         bool Flag = ;

         For(j, , n)

             if(!F[i][j]) {

                 Flag = ;

                 break;

             }

         if(Flag) cout<<Jedi[i].Name<<endl;

     }

 }

 int main() {

     #ifndef ONLINE_JUDGE

     SetIO("C");

     #endif

     Input();

     Solve();

     return ;

 }