#include <bits/stdc++.h>
using namespace std;
int mmax(int a, int b);
int mmin(int a, int b);
int read();
void write(int x);
int main() {
  int len;
  char a[10000];
  cin >> len >> a;
  if (len % 2 == 0) {
    for (int i(0); i < len; ++i) {
      cout << a[i];
      if (i % 2 == 1 && i + 1 != len) cout << '-';
    }
  } else {
    cout << a[0] << a[1] << a[2];
    if (len != 3) cout << '-';
    for (int i(3); i < len; ++i) {
      cout << a[i];
      if (i % 2 == 0 && len != i + 1) cout << '-';
    }
  }
  cout << endl;
  return 0;
}
inline int mmax(int a, int b) { return a > b ? a : b; }
inline int mmin(int a, int b) { return a < b ? a : b; }
inline int read() {
  int x(0), f(1);
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void write(int x) {
  if (x == 0) {
    putchar('0');
    return;
  }
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  char ch[20];
  int num(0);
  while (x > 0) {
    ch[num] = x % 10 + '0';
    x /= 10;
    ++num;
  }
  for (int i(num - 1); i >= 0; --i) putchar(ch[i]);
  return;
}

### Prompt

In Cpp, your task is to solve the following problem:

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.

Input

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

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.

Examples

Input

6
549871


Output

54-98-71

Input

7
1198733


Output

11-987-33

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int mmax(int a, int b);
int mmin(int a, int b);
int read();
void write(int x);
int main() {
  int len;
  char a[10000];
  cin >> len >> a;
  if (len % 2 == 0) {
    for (int i(0); i < len; ++i) {
      cout << a[i];
      if (i % 2 == 1 && i + 1 != len) cout << '-';
    }
  } else {
    cout << a[0] << a[1] << a[2];
    if (len != 3) cout << '-';
    for (int i(3); i < len; ++i) {
      cout << a[i];
      if (i % 2 == 0 && len != i + 1) cout << '-';
    }
  }
  cout << endl;
  return 0;
}
inline int mmax(int a, int b) { return a > b ? a : b; }
inline int mmin(int a, int b) { return a < b ? a : b; }
inline int read() {
  int x(0), f(1);
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void write(int x) {
  if (x == 0) {
    putchar('0');
    return;
  }
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  char ch[20];
  int num(0);
  while (x > 0) {
    ch[num] = x % 10 + '0';
    x /= 10;
    ++num;
  }
  for (int i(num - 1); i >= 0; --i) putchar(ch[i]);
  return;
}

```