测评会员优惠活动进行中 · 开通 VIP,有效期内测评不限次 VIP 优惠中 · 测评不限次 立即查看

A7827. Phone numbers

编程题 普及/提高-

题目描述

Phone 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.

输入格式

The 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.

输出格式

Output 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.

输入输出样例

输入 #1
6
549871
输出 #1
54-98-71
输入 #2
7
1198733
输出 #2
11-987-33
上一题 去做题 下一题