#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
typedef pair<pii,pair<int,string> > P;
int main(){
	int n;
	while(cin>>n,n){
		int t =n;
		priority_queue<P> data;
		//while(!data.empty())data.pop();
		while(t--){
			string str;
			cin>>str;
			int v,l,d;
			v = l = d= 0;
			for(int i =1;i < n;i++){
				int x;
				cin>>x;
				if(x==0){
					v++;
				}else if(x==1){
					l++;
				}else{
					d++;
				}
			}
			data.push(P(mp(v,-l),mp(t,str)));
		}
		while(!data.empty()){
			cout <<data.top().second.second<<endl;
			data.pop();
		}
	}
	return 0;
}