#include <bits/stdc++.h>
using namespace std;

vector <long long> o[10005],inn[10005];

struct Node{
	long long he,ta;
	bool operator <(Node o) {
		if(he != o.he) return he < o.he;
		return ta < o.ta;
	}
}a[10005];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	//freopen("p1.in","r",stdin);
	//freopen("p1.out","w",stdout);
	int n;
	cin >> n;
	string s;
	for(int i = 0;i < n;i++) {
		for(int j = 0;j < 4;j++) {
			cin >> s;
			if(j > 0 && j < 3) continue;
			for(int k = 0;k < s.length();k++) {
				long long tmp = 0;
				if('a' <= s[k] <= 'z') tmp += s[k] - 'a';
				else tmp += s[k] - '0' + 26;
				tmp *= 36;
			}
			if(j == 0) a[i].he = tmp;
			else a[i].ta = tmp;
		}
	}
	sort(a,a + n);
	for(int i = 0;i < n;i++) {
		for(int j = 0;j < n;j++) {
			if(j == i) continue;
			
		}
	}
	return 0;
}