#include<bits/stdc++.h>

using namespace std;
string t;
string ans;

void dfs(int i,string s,int n);
void solve();

int main(void){
    cin >> t;
    solve();
    return 0;
}

void dfs(int i, string s, int n){
      if(i==3){
            if(n==7){
                  ans=s+"=7";
            }
            return ;
      }
      dfs(i+1,s + "+" + t[i + 1],n + (t[i + 1] - '0'));
      dfs(i+1,s + "-" + t[i + 1],n - (t[i + 1] - '0'));
 
}

void solve(){
    dfs(0,t.substr(0,1),t[0]-'0');
    cout << ans << endl;
}

#include <iostream>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <functional> // std::function<void(int)>
using namespace std;
#define int long long
#define All(v) (v).begin(),(v).end()
int dy[4] = {-1,0,1,0};
int dx[4] = {0,1,0,-1};
int Dy[8] = {-1,-1,0,1,1,1,0,-1};
int Dx[8] = {0,1,1,1,0,-1,-1,-1};
const int mod = 1000000007;
const int inf = mod*mod;
const int d5 = 111111;
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int a,b;
    cin>>a;
    cout<<180*(a-2)<<endl;
}