B. Phone numberstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPhone number in Berland is a sequence of n digits. Often, to make it easier to memorize the number, it is divided into groups of two or three digits. For example, the phone number 1198733 is easier to remember as 11-987-33. Your task is to find for a given phone number any of its divisions into groups of two or three digits.InputThe first line contains integer n (2 ≤ n ≤ 100) — amount of digits in the phone number. The second line contains n digits — the phone number to divide into groups.OutputOutput any of divisions of the given phone number into groups of two or three digits. Separate groups by single character -. If the answer is not unique, output any.ExamplesInput6549871Output54-98-71Input71198733Output11-987-33
Input6549871
Output54-98-71
['implementation', '*1100']