1006

#include<iostream>
#include<cstring>
#include<algorithm>
#define N 20
#define INF 0x7ffffff
using namespace std;
int Transform(char s[]);
int main()
{
    int m;
    char First_Id[N], Last_Id[N];
    int S_First_time, E_Last_time;
    S_First_time = INF;
    E_Last_time = 0;
    cin >> m;
    while (m--)
    {
        int S_time, E_time;
        char id[N], s[N], e[N];
        cin >> id >> s >> e;
        S_time = Transform(s);
        E_time = Transform(e);
        if (S_time < S_First_time)
        {
            S_First_time = S_time;
            strcpy(First_Id, id);
        }
        if (E_time > E_Last_time)
        {
            E_Last_time = E_time;
            strcpy(Last_Id, id);
        }
    }
    cout << First_Id << ' ' << Last_Id << endl;
    system("pause");
    return 0;
}
int Transform(char s[])
{
    int t = 0;
    t = (s[0] - '0') * 10 + (s[1] - '0');
    t = t * 60 + (s[3] - '0') * 10 + (s[4] - '0');
    t = t * 60 + (s[6] - '0') * 10 + (s[7] - '0');
    return t;
}