#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repm(i,m,n) for (int i = (m); i < (n); i++)
using namespace std;
typedef long long ll;

string ans, S, T;

void dfs(int i, int total, string T) {
  if (i == S.size()) {
    if (total == 7) ans = T + "=7";
    return;
  }
  
  dfs(i+1, total+S.at(i)-'0'  , T+'+'+S.at(i));
  dfs(i+1, total-(S.at(i)-'0'), T+'-'+S.at(i));
}

int main() {
  cin >> S;
  T = S.at(0);
  dfs(1, S[0]-'0', T);
  cout << ans << endl;
}