#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int N = 3 + 2e5;
vector<int> a, b;
int n;
char s[N];
mt19937 rnd(time(NULL));
string ss[3];
void solve(vector<int>& a, vector<int>& b, string& s) {
  b.clear();
  ll x = a[0];
  s = a[0] + '0';
  int n = a.size();
  for (int i = 1; i < n; ++i) {
    s += '+';
    s += a[i] + '0';
    if (i + 1 < n && (rnd() & 1)) {
      s += a[i + 1] + '0';
      x += a[i] * 10 + a[i + 1];
      ++i;
    } else {
      x += a[i];
    }
  }
  do {
    b.push_back(x % 10);
    x /= 10;
  } while (x);
  reverse(b.begin(), b.end());
}
int main() {
  cin >> n >> s + 1;
  for (;;) {
    a.clear();
    for (int i = 1; i <= n; ++i) a.push_back(s[i] - '0');
    solve(a, b, ss[0]);
    solve(b, a, ss[1]);
    solve(a, b, ss[2]);
    if (b.size() == 1) {
      break;
    }
  }
  for (int i = 0; i < 3; ++i) {
    cout << ss[i] << endl;
  }
  return 0;
}
