#include <algorithm>
#include <cstdint>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using pii = std::pair<i32, i32>;
using pll = std::pair<i64, i64>;
using vi = std::vector<i32>;
using vll = std::vector<i64>;
using vpii = std::vector<pii>;
using vpll = std::vector<pll>;
void solve();
int main()
{
std::cin.tie(nullptr)->sync_with_stdio(false);
solve();
}
i32 str_time_to_i32_time(const std::string &str)
{
std::string res;
for (auto &item : str)
{
if (item != ':')
{
res += item;
}
}
return std::stoi(res);
}
void solve()
{
struct Info
{
std::string name;
i32 sign_in, sign_out;
};
i32 t;
std::cin >> t;
bool endl = false;
for (i32 i = 1; i <= t; ++i)
{
if (endl)
{
std::cout << '\n';
}
i32 n;
std::cin >> n;
std::vector<Info> infos;
for (i32 j = 1; j <= n; ++j)
{
std::string name, in_time, out_time;
std::cin >> name >> in_time >> out_time;
infos.emplace_back(Info{name, str_time_to_i32_time(in_time), str_time_to_i32_time(out_time)});
}
std::sort(infos.begin(), infos.end(), [](const Info &a, const Info &b) { return a.sign_in < b.sign_in; });
std::cout << infos[0].name << ' ';
std::sort(infos.begin(), infos.end(), [](const Info &a, const Info &b) { return a.sign_out > b.sign_out; });
std::cout << infos[0].name;
endl = true;
}
}