#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);(i)++)
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);(i)++)
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);(i)--)
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);(i)--)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; }return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; }return 0; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }

using T = tuple<int, int, int, char>;
int main() {
    init();

    int n;
    while (1) {
        cin >> n;
        if (n == 0)break;
        vector<T> team(n);
        FOR(i, 0, n) {
            char t; int w = 0, l = 0, r;
            cin >> t;
            FOR(j, 0, n - 1) {
                cin >> r;
                if (r == 0)w--;
                else if (r == 1)l++;
            }
            team[i] = make_tuple(w, l, i, t);
        }
        SORT(team);
        FOR(i, 0, n)cout << get<3>(team[i]) << "\n";
    }
}

