#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>
#include <math.h>
#include <algorithm>
#include <deque>
#include <climits>
using namespace std;
#define rep(i,l,r) for(int i=l;i<r;i++)
#define repb(i,r,l) for(int i=r;i>l;i--)
#define ll long long
#define ull unsigned long long
#define ve vector
#define umap unordered_map
#define iter iterator

int main() {
    ll x; cin>>x;
    ll n = x/11, r = x%11;
    if(r>6) cout<<n*2 + 2;
    else if(r>0) cout<<n*2 + 1;
    else cout<<n*2;
    return 0;
}
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
using ll = long long;

void solve()
{
    string s;
    cin >> s;
    rep(bit, 1 << 3)
    {
        int tmp = s[0] - '0';
        string ans;
        ans += s[0];
        rep(i, 3)
        {
            if (bit & (1 << i))
            {
                tmp += s[i + 1] - '0';
                ans += "+";
                ans += s[i + 1];
            }
            else
            {
                tmp -= s[i + 1] - '0';
                ans += "-";
                ans += s[i + 1];
            }
        }
        if (tmp == 7)
        {
            printf("%s=7\n", ans.c_str());
            return;
        }
    }
}

int main()
{
    solve();
    return 0;
}