Clock

Kiwon's room has an analog clock with an hour hand and a minute hand. Kiwon enjoys measuring the smaller of the two angles formed by the hour and minute hands; this angle is always between 0 and 180 degrees, inclusive.

Given five distinct times in hh:mm format, we want to compute the smaller angle formed by each time's hour and minute hands, then find the time whose angle is the median (the third smallest of the five).

In other words, sort the five times in ascending order of angle and output the one in the third position. If several times share the same angle, order them so that the earlier time of day (the one with the smaller value when hh:mm is converted to minutes) comes first.

For example, given 06:05, 07:10, 03:00, 21:00, 12:55, sorting by angle gives 12:55, 03:00, 21:00, 06:05, 07:10, so the time in the third position (the median) is 21:00.

Help Kiwon by writing a program that finds the time with the median angle among the given times.

The first line contains the number of test cases $T$.

Each test case consists of five distinct times in hh:mm format, separated by a single space.

Each time satisfies $00 \le hh \le 23$ and $00 \le mm \le 59$.

For each test case, print the time whose angle is the median, in hh:mm format, one per line.