#include <bits/stdc++.h>
#include <regex>
#ifdef _DEBUG
#include "debug.h"
#endif
#define int ll
#define FOR(i, s, e) for (int i = int(s); i < int(e); ++i)
#define REP(i, e) FOR(i, 0, e)
#define all(v) (v).begin(),(v).end()
#define mkpr make_pair
#define mktp make_tuple
#define tv(tp, i) get<(i)>(tp)
#define CLEAR(obj) obj = decltype(obj)()
#define var auto
#define OUT(type) type &
#define IN(type) const type &
#define self (*this)
#define in :
#define True true
#define False false
using namespace std; using int32 = int32_t; using str = string; using cstr = const str;
using ll = long long; using ull = unsigned long long; using cint = const int; using cll = const ll;
using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>;
using vb = vector<bool>; using vvb = vector<vb>; using vd = vector<double>; using vvd = vector<vd>;
using vc = vector<char>; using vvc = vector<vc>; using vs = vector<string>;
using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<double, double>; using psl = pair<string, ll>;
using tiii = tuple<int, int, int>; using tlll = tuple<ll, ll, ll>;
static const int MGN = 10; static const int ARYSZ_MAX = (int)1e7;
static const ll LINF = LLONG_MAX/2;
#ifdef int
static const int INF = LINF;
#else
static const int INF = INT_MAX/2;
#endif
static double EPS = 1e-9;
#define FASTCIN() cin.tie(0);ios::sync_with_stdio(false);
#ifdef IMPORT_SAMPLE
#define DEBUG_IMPORT(file) vs args(argv, argv+argc);str sample = make_sample(args, file);ifstream ifs(sample); cin.rdbuf(ifs.rdbuf());
#else
#define DEBUG_IMPORT(file)
#endif
static inline bool DBLEQ(double a, double b) {return abs(a - b) < EPS;}
static inline void EPR(str msg) {cerr << msg << endl;}
static inline void AST(bool exp, str msg) {if(!exp){EPR(msg);} assert(exp);}
static inline void TAST(bool exp, str msg) {if(!exp){EPR(msg);} while(!exp){}}


int calc(IN(vi) A, int ptn) {
    int N = A.size();
    int sum = 0;

    AST((ptn>>(N-1) & 0b01) == 1, "最上位は +");
    // A[3], A[2], A[1], A[0]
    REP(i, N) {
        if ((ptn & 0b01) == 1)
            sum += A[i];
        else
            sum -= A[i];

        ptn >>= 1;
    }

    return sum;
}

str to_str(IN(vi) A, int ptn) {
    int N = A.size();

    AST((ptn>>(N-1) & 0b01) == 1, "最上位は +");
    str res = "";
    // A[3], A[2], A[1], A[0]
    REP(i,N) {
        if ((ptn & 0b01) == 1)
            res = "+" + to_string((A[i])) + res;
        else
            res = "-" + to_string((A[i])) + res;
        ptn >>= 1;
    }
    res += "=7";
    int L = res.size();
    return res.substr(1, L-1);  // 最初の + をカット
}

str bitfs(IN(vi) A) {
    int N = A.size();
    int res = 0;
    REP(p, 1<<N) {
        int ptn = p;
        if ((ptn >> (N-1)) == 0)
            continue;

        int pres = calc(A, ptn);

        if (pres == 7)
            return to_str(A, ptn);
    }
    return "";
}

int32 main(int32 argc, char* argv[]) {
    FASTCIN();
    DEBUG_IMPORT("sample-2");


    str S; cin>>S;
    int N = S.size();
    vi A(N);
    REP(i,N)
        A[i] = S[i]-'0';

    reverse(A.begin(), A.end());  // A[3], A[2], A[1], A[0]
    str ans = bitfs(A);
    cout << ans << endl;


    return 0;
}


Measured memory_bytes: 384