A. Table Tennis Match
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Alice and Bob play a table tennis match under the 11-point system. Alice wins the match in the end. The rules for ending the match are as follows:

  • If one player reaches $$$11$$$ points first and leads the opponent by at least $$$2$$$ points, the match ends immediately (e.g. $$$11:0$$$, $$$11:9$$$).
  • If the score is tied at $$$10:10$$$, the match goes to deuce. After that, the match can only end when one player takes a lead of $$$2$$$ points (e.g. $$$12:10$$$, $$$13:11$$$).
Given the total score $$$N$$$ (the sum of scores of both players) when the match ends, please output the final score of Alice and Bob.
Input

The first line contains a positive integer $$$T$$$ $$$(1 \le T \le 10^5)$$$, representing the number of test cases. Then $$$T$$$ lines follow. Each line contains a positive integer $$$N$$$ $$$(11 \le N \le 10^9)$$$. It is guaranteed that $$$N$$$ is a valid final state of the match.

Output

For each test case, output one line with the score in the format a:b. An example is 11:5.

Example
Input
6
11
14
20
22
24
30
Output
11:0
11:3
11:9
12:10
13:11
16:14