//
//  na 2656.cpp
//  Competitive Programming
//
//  Created by m2 on 2024/11/26.
//

#include <stdio.h>
#include <iostream>
using namespace std;
const int maxn = 1e6 + 5;
int n = -1;
char s[maxn];
inline bool prec(int l, int m, int r){
    if(l <= 0 || m <= 0 || r <= 0 || l + m + r != n)
        return false;
    return ((l = max(l, m)) == r || l + 1 == r) && s[l] != 0 && s[l + m] != 0;
}
inline void print(int l, int m, int r){
    for(int i = 0; i < l; ++i)
        putchar(s[i] ^ 48);
    putchar('+');
    for(int i = 0; i < m; ++i)
        putchar(s[l + i] ^ 48);
    putchar('=');
    for(int i = 0; i < r; ++i)
        putchar(s[l + m + i] ^ 48);
    putchar('\n');
}
inline bool check(int l, int m, int r){
//    fprintf(stderr, "check(%d, %d, %d)\n", l, m, r);
    if(!prec(l, m, r)){
//        cerr << "precheck err" << endl;
        return false;
    }
    bool ma = max(l, m) == r - 1;
    bool add = false;
    int bl = l, bm = l + m, br = n, d;
    for(int i = 1; i <= r; ++i){
        d = add;
        if(i <= l)
            d += s[bl - i];
        if(i <= m)
            d += s[bm - i];
        if(d >= 10){
            add = true;
            d -= 10;
        }else{
            add = false;
        }
        if(d != s[br - i] || (ma && !add && i != r)){
//            cerr << "err @" << i << endl;
            return false;
        }
    }
    print(l, m, r);
    return true;
}
int main(){
    cin.tie(0)->sync_with_stdio(false);
    while((s[++n] = getchar()) - 48 < 10u)
        s[n] ^= 48;
    if(s[0] == 0){ // ???
        cin >> n;
        for(int i = 0; i < n; ++i)
            s[i] = s[i + n + n] = 1;
        for(int i = n; i < n * 2; ++i)
            s[i] = 9;
        s[n + n + n] = 0;
        n = n * 3 + 1;
    }
    for(int l = 1; l <= n / 2; ++l){
        int r = max(l, (n - l) / 2), m = n - l - r;
        if(check(l, m, r))
            break;
        ++r;
        --m;
        if(check(l, m, r))
            break;
        ++r;
        --m;
        if(check(l, m, r))
            break;
    }
    return 0;
}