#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long INF = 1e18L;
const double eps = 1e-9;
const long long mod = 1e9 + 7;
const double pi = 2.0 * acos(0.0);
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n;
  cin >> n;
  string s;
  cin >> s;
  if (n == 3) {
    cout << s << "\n";
    return 0;
  }
  if (n % 3 == 1) {
    for (long long i = 0; i < n - 4; i += 3) {
      cout << s.substr(i, 3) << "-";
    }
    cout << s.substr(n - 4, 2) << "-";
    cout << s.substr(n - 2, 2) << "\n";
    return 0;
  }
  if (n % 3 == 0) {
    long long i;
    for (i = 0; i < (n / 3 - 1) * 3; i += 3) {
      cout << s.substr(i, 3) << "-";
    }
    cout << s.substr(i, 3) << "\n";
    return 0;
  }
  long long i;
  for (i = 0; i < n / 3 * 3; i += 3) {
    cout << s.substr(i, 3) << "-";
  }
  cout << s.substr(i, 3) << "\n";
  return 0;
}

### Prompt

Create a solution in cpp for 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;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long INF = 1e18L;
const double eps = 1e-9;
const long long mod = 1e9 + 7;
const double pi = 2.0 * acos(0.0);
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n;
  cin >> n;
  string s;
  cin >> s;
  if (n == 3) {
    cout << s << "\n";
    return 0;
  }
  if (n % 3 == 1) {
    for (long long i = 0; i < n - 4; i += 3) {
      cout << s.substr(i, 3) << "-";
    }
    cout << s.substr(n - 4, 2) << "-";
    cout << s.substr(n - 2, 2) << "\n";
    return 0;
  }
  if (n % 3 == 0) {
    long long i;
    for (i = 0; i < (n / 3 - 1) * 3; i += 3) {
      cout << s.substr(i, 3) << "-";
    }
    cout << s.substr(i, 3) << "\n";
    return 0;
  }
  long long i;
  for (i = 0; i < n / 3 * 3; i += 3) {
    cout << s.substr(i, 3) << "-";
  }
  cout << s.substr(i, 3) << "\n";
  return 0;
}

```