CF926I A Vital Problem

Polycarp has a strict daily schedule. He has $ n $ alarms set for each day, and the $ i $ -th alarm rings each day at the same time during exactly one minute. Determine the longest time segment when Polycarp can sleep, i. e. no alarm rings in that period. It is possible that Polycarp begins to sleep in one day, and wakes up in another.

The first line contains a single integer $ n $ ( $ 1

Print a line in format "hh:mm", denoting the maximum time Polycarp can sleep continuously. $ hh $ denotes the number of hours, and $ mm $ denotes the number of minutes. The number of minutes should be between $ 0 $ and $ 59 $ . Look through examples to understand the format better.

In the first example there is only one alarm which rings during one minute of a day, and then rings again on the next day, $ 23 $ hours and $ 59 $ minutes later. Polycarp can sleep all this time.