#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const double PI = 3.14159265359;
int getVal(int mask, string s) {
  int n = s.size();
  int cur = 0, ans = 0;
  for (int i = 0; i < n; i++) {
    int temp = s[i] - '0';
    cur *= 10;
    cur += temp;
    if (mask & 1) {
      ans += cur;
      cur = 0;
    }
    mask = (mask >> 1);
  }
  ans += cur;
  return ans;
}
void printRep(int mask, string s) {
  int n = s.size();
  for (int i = 0; i < n; i++) {
    cout << s[i];
    if (mask & 1) cout << "+";
    mask = (mask >> 1);
  }
}
void findAns(string s) {
  int n = s.size();
  for (int mask = 0; mask < 1 << n; mask++) {
    int val2 = getVal(mask, s);
    string s2 = to_string(val2);
    int m = s2.size();
    int val3 = getVal((1 << m) - 1, s2);
    if (val3 < 10) {
      printRep(mask, s);
      cout << endl;
      printRep((1 << (m - 1)) - 1, s2);
      return;
    }
  }
}
bool findAns2(int val) {
  string s = to_string(val);
  int n = s.size();
  for (int mask = 0; mask < 1 << n; mask++) {
    int val2 = getVal(mask, s);
    string s2 = to_string(val2);
    int m = s2.size();
    int val3 = getVal((1 << m) - 1, s2);
    if (val3 < 10) {
      return true;
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  string s;
  int n, sum = 0;
  cin >> n >> s;
  uniform_int_distribution<int> dist(0, 1);
  default_random_engine gen(0);
  for (int k = 0; k < 100; k++) {
    string s2;
    sum = 0;
    for (int i = 0; i < n; i++) {
      s2 += s[i];
      if (i < n - 1 && s[i] != '0') {
        int randNum = dist(gen);
        if (randNum) {
          sum += 10 * (s[i] - '0') + (s[i + 1] - '0');
          i++;
          s2 += s[i];
        } else {
          sum += s[i] - '0';
        }
      } else {
        sum += s[i] - '0';
      }
      if (i != n - 1) {
        s2 += '+';
      }
    }
    if (findAns2(sum)) {
      cout << s2 << endl;
      findAns(to_string(sum));
      return 0;
    }
  }
  return 0;
}
