#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    while(cin >> n, n){
        vector<pair<int, int>> v;
        for (int i = 0; i < n; ++i) {
            int x, y = 0;
            cin >> x;
            for (int j = 0; j < 4; ++j) {
                int a, b;
                scanf("%d %d", &a, &b);
                y += a*60+b;
            }
            v.emplace_back(y, x);
        }
        sort(v.begin(),v.end());
        printf("%d\n%d\n%d\n", v[0].second, v[1].second, v.end()[-2].second);
    }

    return 0;
}
