# Time To Get Up

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 524288/524288 K (Java/Others)

## Description

Little Q's clock is alarming! It's time to get up now! However, after reading the time on the clock, Little Q lies down and starts sleeping again. Well, he has $5$ alarms, and it's just the first one, he can continue sleeping for a while.

Little Q's clock uses a standard 7-segment LCD display for all digits, plus two small segments for the '':'', and shows all times in a 24-hour format. The '':'' segments are on at all times.

Your job is to help Little Q read the time shown on his clock.

## Input

The first line of the input contains an integer $T(1\leq T\leq1440)$, denoting the number of test cases.

In each test case, there is an $7\times 21$ ASCII image of the clock screen.

All digit segments are represented by two characters, and each colon segment is represented by one character. The character ''X'' indicates a segment that is on while ''.'' indicates anything else. See the sample input for details.

## Output

For each test case, print a single line containing a string $t$ in the format of $HH:MM$, where $t(00:00\leq t\leq 23:59)$, denoting the time shown on the clock.

## Sample Input

1
.XX...XX.....XX...XX.
X..X....X......X.X..X
X..X....X.X....X.X..X
......XX.....XX...XX.
X..X.X....X....X.X..X
X..X.X.........X.X..X
.XX...XX.....XX...XX.

## Sample Output

02:38

liuyiding

## Source

2017 Multi-University Training Contest - Te