/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
//       oid write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 1e6 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 520040527;
const ull P=10;

string s;
int n;
int pw[N],hs[N];

inline pii min(pii a,pii b){
    return a<b?a:b;
}

pii ans={INF,INF};



inline int getHs(int l,int r){
    return (hs[r]-hs[l-1]*pw[r-l+1]%MOD+MOD)%MOD;
}

bool check(int a,int b){
    if(a<=0||a>=b)return 0;
    // if()return 0;
    if(s[a+1]=='0'&&b-a>1)return 0;
    if(s[b+1]=='0'&&n-b>1)return 0;

    int ha=getHs(1,a);
    int hb=getHs(a+1,b);
    int hc=getHs(b+1,n);

    // cdbg("ck",a,b,ha,hb,hc);
    if((ha+hb)%MOD==hc%MOD)return 1;
    return 0;

}

signed main() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);


    cin>>s;
    n=s.size();
    s=" "+s;

    pw[0]=1;
    for(int i=1;i<=n;i++){
        pw[i]=pw[i-1]*P%MOD;
    }
    for(int i=1;i<=n;i++){
        hs[i]=(hs[i-1]*P%MOD+(s[i]-'0'))%MOD;
    }


    for(int i=n/2;i<=n-n/3+1;i++){
        //枚举=位置(i后面)
        int len=n-i;
        if(check(len,i))ans=min(ans,mp(len,i));
        if(check(len-1,i))ans=min(ans,mp(len-1,i));
        if(check(len+1,i))ans=min(ans,mp(len+1,i));
        if(check(i-len,i))ans=min(ans,mp(i-len,i));
        if(check(i-len-1,i))ans=min(ans,mp(i-len-1,i));
        if(check(i-len+1,i))ans=min(ans,mp(i-len+1,i));
    }

    // cdbg(ans.pf,ans.ps);
    if(ans.pf==INF)assert(0);

    for(int i=1;i<=n;i++){
        putchar(s[i]);
        if(i==ans.pf)putchar('+');
        if(i==ans.ps)putchar('=');
    }

    


}