#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1000000 + 5;

int N;
char s[MAX_N];
template<int P> struct Hash {
    int ha[MAX_N], pw[MAX_N];
    void init() {
        pw[0] = P - 1;
        for (int i = 1; i <= N; i ++) {
            pw[i] = pw[i - 1] * 10ll % P;
            ha[i] = (ha[i - 1] * 10ll + (s[i] - '0')) % P;
        }
    }
    int get(int l, int r) {
        return (ha[r] + 1ll * pw[r - l + 1] * ha[l - 1]) % P;
    }
    bool check(int x, int y) {
        int a = get(1, x);
        int b = get(x + 1, y);
        int c = get(y + 1, N);
        return (a + b) % P == c;
    }
};
Hash<999999337> h1;
Hash<999999001> h2;
Hash<999999667> h3;

void check(int x, int y) {
    if (1 > x) return;
    if (x + 1 > y) return;
    if (y + 1 > N) return;
    if (s[x + 1] == '0') return;
    if (s[y + 1] == '0') return;
    if (!h1.check(x, y)) return;
    if (!h2.check(x, y)) return;
    if (!h3.check(x, y)) return;
    for (int i = 1; i <= N; i ++) {
        printf("%c", s[i]);
        if (i == x) printf("+");
        if (i == y) printf("=");
        if (i == N) printf("\n");
    }
    exit(0);
}
int main() {
    scanf("%s", s + 1);
    N = strlen(s + 1);
    h1.init();
    h2.init();
    h3.init();
    for (int x = 1; x <= N; x ++) {
        check(x, N - x);
        check(x, N - x - 1);
        check(N - x * 2, N - x);
        check(N - x * 2 - 1, N - x - 1);
    }
    return 0;
}