#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
using namespace std;
const unsigned _mod = 998244353;
const unsigned mod = 1e9 + 7;
const long long infi = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
long long ksm(long long x, long long y) {
  long long ret = 1;
  while (y) {
    if (y & 1ll) ret = ret * x % mod;
    y >>= 1ll;
    x = x * x % mod;
  }
  return ret;
}
long long qpow(long long x, long long y, long long m) {
  long long ret = 1;
  while (y) {
    if (y & 1ll) ret = ret * x % m;
    y >>= 1ll;
    x = x * x % m;
  }
  return ret;
}
long long _gcd(long long x, long long y) { return y ? _gcd(y, x % y) : x; }
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n, res, sum;
string a, b, ans;
vector<string> v;
int main() {
  cin >> n >> a;
  while (1) {
    b = a;
    v.clear();
    for (register int i = 1; i <= 3; ++i) {
      ans = "";
      res = sum = 0;
      n = b.length();
      for (register int j = 0; j < b.size(); ++j) {
        sum = sum * 10 + b[j] - '0';
        ans += b[j];
        if (rand() % 255 > 0 || j + 1 == n) {
          res += sum;
          sum = 0;
          if (j + 1 < n) ans += "+";
        }
      }
      v.emplace_back(ans);
      b = to_string(res);
    }
    if (b.length() == 1) break;
  }
  for (register int i = 0; i < v.size(); ++i) cout << v[i] << '\n';
  return 0;
}
