Problem Description

Alice likes her digital alarm clock. She sets it up every evening. Last night, Alice had a dream about her clock. Unfortunately, the only thing she can remember is the number of highlighted segments on the clock. Alice wonders what time was set on the clock in her dream.

Alice's clock has four digits: two for hours and two for minutes. For example, the clock below shows $9:30$ (note the leading zero).

The clock uses the following digit representation.

The segment count refers to the sum of the number of segments required to display each digit of the time. For example, for the time 09:30, the segment count is $6 + 6 + 5 + 6 = 23$.

Input Format

The only line of the input file contains a single integer $n$ — the number of highlighted segments on the clock in Alice's dream $(0 \le n \le 30)$.

Output Format

Output five characters in the $\text{hh:mm}$ format — the time shown on the clock in Alice's dream. The time must be correct: $0 \le \text{hh} < 24$ and $0 \le \text{mm} < 60$. If there are many possible correct times, output any of them. If there is none, output Impossible.

Sample Input and Output

Sample Input #1

23

Sample Output #1

09:30

Sample Input #2

28

Sample Output #2

Impossible

Sample Input #3

2

Sample Output #3

Impossible

Notes/Hints

Time limit: 2 seconds, Memory limit: 256 MB.

Special Judge provider: @rzh123

见题面 Input 部分

见题面 Output 部分