#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <queue>
#include <cmath>
#include <vector>
#include <algorithm>

using namespace std;
/*
long long cnt[1000005];
void init()
{
    memset(cnt, 0, sizeof(cnt));
    for(int i = 1; i <= 1000; ++i)
        for(int j = 1; j <= 1000; ++j)
            ++cnt[i*i+j*j];
}
int main()
{
   // init();
    int a, b;
    cin >> a >> b;
    pair<int, int> pointA[1010], pointB[1010];

    int pos1 = 0, pos2 = 0;
    for(int i = 1; i <= 1000; ++i)
        for(int j = 1; j <= 1000; ++j)
        {
            if(i*i+j*j==a*a) {pointA[pos1].first = i;pointA[pos1++].second = j;}
            if(i*i+j*j==b*b) {pointB[pos2].first = -i;pointB[pos2++].second = j;}
        }
    for(int i = 0; i < pos1; ++i)
        for(int j = 0; j < pos2; ++j)
        {
            if(pointA[i].first*pointB[j].first + pointA[i].second*pointB[j].second == 0 && pointA[i].second!= pointB[j].second)
            {
                printf("YES\n");
                printf("0 0\n%d %d\n%d %d\n",pointA[i].first,pointA[i].second,pointB[j].first,pointB[j].second);
                return 0;
            }
        }

    cout << "NO" << endl;
    return 0;
}
*/
/*
bool check(long long x)
{
    x = abs(x);

    while(x > 0 && x <= 8888888888)
    {
        //cout << "abs "<< x << endl;
        long long temp = x%10;
        if(temp == 8) return true;
        x /= 10;
    }
    return false;
}
int main()
{
    long long a;
    while(cin >> a)
    {
        int pos = 0;
        for(int i = 1; i <= 20; ++i)
        {
            if(check(a+i))
            {
                pos = i; break;
            }
        }
        cout << pos << endl;
    }
}*/

int main()
{
    char s[10];
    int num[4];
    scanf(" %s", s);
    for(int i = 0; i < 4; ++i)
        num[i] = s[i]-'0';
    int re = 0;
    for(int i = 0; i < 2; ++i)
        for(int j = 0; j < 2; ++j)
            for(int k = 0; k < 2; ++k){

                re = num[0];
                if(i == 0) re += num[1];
                else re -= num[1];

                if(j == 0) re += num[2];
                else re -= num[2];

                if(k == 0) re += num[3];
                else re -= num[3];

                if(re == 7)
                {
                    cout << num[0] << (i?'-':'+') << num[1] << (j?'-':'+') << num[2] << (k?'-':'+') << num[3] << "=7" << endl;
                    return 0;
                }
            }

}
