#include <bits/stdc++.h>
using namespace std;
int readint() {
  char c;
  while (c = getchar(), (c < '0' || c > '9') && c != '-')
    ;
  bool flag = (c == '-');
  if (flag) c = getchar();
  int x = 0;
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - 48;
    c = getchar();
  }
  return flag ? -x : x;
}
inline string tos(int x) {
  string s;
  while (x) s = (char)(x % 10 + '0') + s, x /= 10;
  return s;
}
inline int pt(int a[], int l, int r) {
  int p, i, j;
  p = a[l];
  i = l;
  j = r + 1;
  for (;;) {
    while (a[++i] < p)
      if (i >= r) break;
    while (a[--j] > p)
      if (j <= l) break;
    if (i >= j)
      break;
    else
      swap(a[i], a[j]);
  }
  if (j == l) return j;
  swap(a[l], a[j]);
  return j;
}
inline void q_sort(int a[], int l, int r) {
  int q;
  if (r > l) {
    q = pt(a, l, r);
    q_sort(a, l, q - 1);
    q_sort(a, q + 1, r);
  }
}
string s[5], w[5];
int n;
inline void dfs(int i, int j, int cur, int sum) {
  if (i == 3) {
    if (s[i].size() == 1) {
      cout << w[0] << endl << w[1] << endl << w[2];
      exit(0);
    }
    return;
  }
  if (j == s[i].size()) {
    stringstream ss;
    ss << (sum + cur);
    ss >> s[i + 1];
    dfs(i + 1, 0, 0, 0);
    return;
  }
  if (j) {
    w[i] += '+';
    w[i] += s[i][j];
    dfs(i, j + 1, s[i][j] - '0', sum + cur);
    w[i].pop_back();
    w[i].pop_back();
  }
  if (cur < 1e7) {
    w[i] += s[i][j];
    dfs(i, j + 1, cur * 10 + s[i][j] - '0', sum);
    w[i].pop_back();
  }
}
int main() {
  cin >> n >> s[0];
  srand(time(NULL));
  while (1) {
    int i, j, x, sum;
    i = j = 0;
    sum = 0;
    x = rand() % 999 + 1;
    w[0] = "", w[1] = "", w[2] = "", w[3] = "", w[4] = "";
    while (i < n) {
      if (i == n - 1 || rand() % 1000 < x) {
        w[0] += s[0][i];
        w[0] += '+';
        sum += s[0][i] - '0';
        i++;
      } else {
        w[0] += s[0][i];
        w[0] += s[0][i + 1];
        w[0] += '+';
        sum += (s[0][i] - '0') * 10 + s[0][i + 1] - '0';
        i += 2;
      }
    }
    w[0].pop_back();
    stringstream ss;
    ss << sum;
    ss >> s[1];
    dfs(1, 0, 0, 0);
  }
  return 0;
}
