Chandan, our problem moderator, recently got a digital clock as a birthday present. A digital clock shows time in the format \(HH:MM:SS\), where \(HH, MM, SS\) represents hours , minutes, and seconds respectively. It is a \(24\) hour clock and so the day starts at \(00:00:00\) hours while it ends at \(23:59:59\).

We all know how punctual and particular Chandan is about each and every second of his life. One sunny day, at his leisure, when he was fiddling with his clock, he discovered that a second was good for him if none of the \(HH, MM\; and \; SS\) at that second was divisible by the same prime number, i.e. it is bad if all of them give 0 as a remainder when divided by the same prime number.

Given a time of a day, Chandan now wants to count the number of good times and bad times from that instance till the end of the day \((23:59:59)\).

Input & Output:

The first line of the input contains the number of test cases T. T test cases follow and each test contains a line HH MM SS, the time from which he wants to count till the end of that day.

For each test case, output a ratio in the format "\(B:G\)" (quotes for clarity), where G is the the number of good seconds and B is the number of bad seconds for Chandan. Express the ratio \(B : G\) in its lowest terms, i.e. it should not have any common factor.

Constraints

\(1 \le T \le 10 ^ 5\)
\(00\) ≤ \(HH\) < \(24\)
\(00\) ≤ \(MM\) < \(60\)
\(00\) ≤ \(SS\) < \(60\)