awe

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
int main() {
    int n, a , b, c, l , r ,ans = 0;
    cin >> n;
    vector<pair<int,int>> v(n);
    for (int i = 0; i < n; i++){
        cin >> a >> b >> c;
        v[i].first = a*3600 + b*60 + c;
        cin >> a >> b >> c;
        v[i].second = a*3600 + b*60 + c;
    }
    sort(v.begin(),v.end());

    r = 0;
    l = 12345678;
    for (int i = 0; i < n; i++){
        if( r < v[i].first){
            r = v[i].first;
        }
        if( l > v[i].second){
            l = v[i].second;
        }
    }
    cout<<l<<' '<<r<<endl;
    cout<< abs(l - r)<<endl;



    cout<<endl;
    return 0;
}