#include <bits/stdc++.h>
using namespace std;
template <typename... T>
void rd(T &...args) {
  ((cin >> args), ...);
}
template <typename... T>
void pp(T... args) {
  ((cout << args << " "), ...);
  cout << "\n";
}
void add(long long &x, long long y) {
  x += y;
  if (x >= 1000000007) x %= 1000000007;
  if (x < 0) x = x % 1000000007 + 1000000007;
}
void solve() {
  int n;
  rd(n);
  string s;
  rd(s);
  string ans;
  if (n <= 3)
    cout << s << "\n";
  else {
    if (!(n & 1)) {
      for (int i = 0; i + 1 < n; i += 2) {
        ans.push_back(s[i]);
        ans.push_back(s[i + 1]);
        ans.push_back('-');
      }
      ans.pop_back();
    } else {
      int i = 0;
      ans.push_back(s[i]);
      ans.push_back(s[i + 1]);
      ans.push_back(s[i + 2]);
      ans.push_back('-');
      for (int i = 3; i + 1 < n; i += 2) {
        ans.push_back(s[i]);
        ans.push_back(s[i + 1]);
        ans.push_back('-');
      }
      ans.pop_back();
    }
    cout << ans << "\n";
  }
}
void prep() {}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << fixed << setprecision(12);
  prep();
  int t = 1;
  while (t--) solve();
  return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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;
template <typename... T>
void rd(T &...args) {
  ((cin >> args), ...);
}
template <typename... T>
void pp(T... args) {
  ((cout << args << " "), ...);
  cout << "\n";
}
void add(long long &x, long long y) {
  x += y;
  if (x >= 1000000007) x %= 1000000007;
  if (x < 0) x = x % 1000000007 + 1000000007;
}
void solve() {
  int n;
  rd(n);
  string s;
  rd(s);
  string ans;
  if (n <= 3)
    cout << s << "\n";
  else {
    if (!(n & 1)) {
      for (int i = 0; i + 1 < n; i += 2) {
        ans.push_back(s[i]);
        ans.push_back(s[i + 1]);
        ans.push_back('-');
      }
      ans.pop_back();
    } else {
      int i = 0;
      ans.push_back(s[i]);
      ans.push_back(s[i + 1]);
      ans.push_back(s[i + 2]);
      ans.push_back('-');
      for (int i = 3; i + 1 < n; i += 2) {
        ans.push_back(s[i]);
        ans.push_back(s[i + 1]);
        ans.push_back('-');
      }
      ans.pop_back();
    }
    cout << ans << "\n";
  }
}
void prep() {}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << fixed << setprecision(12);
  prep();
  int t = 1;
  while (t--) solve();
  return 0;
}

```