#include <bits/stdc++.h>

using namespace std;

#define int long long
#define x first
#define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 1000010;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 9, base = 10;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

char str[N];
int n, hsh[N], fc[N];

inline int gethash(int l, int r) { return (hsh[r] - hsh[l - 1] * fc[r - l + 1] % mod + mod) % mod; }

void print(int L, int R)
{
    for (int i = 1; i <= n; i ++)
    {
        if (i == L) putchar('+');
        else if (i == R) putchar('=');
        putchar(str[i]);
    }
    putchar(10);
}

inline bool zero(int L, int R) { return str[L] == '0' && L < R; }

bool check(int L, int R)
{
    // DEBUG(L, R);
    if (L <= 1 || zero(1, L - 1) || zero(L, R - 1) || zero(R, n)) return false;
    else if ((gethash(1, L - 1) + gethash(L, R - 1)) % mod == gethash(R, n) % mod)
        // return print(L, R), true;
        return true;
    return false;
}

PII ans(INF, INF);

signed main()
{
    for (int i = fc[0] = 1; i < N; i ++) fc[i] = fc[i - 1] * base % mod;
    scanf("%s", str + 1), n = strlen(str + 1);
    for (int i = 1; i <= n; i ++) hsh[i] = (hsh[i - 1] * base + str[i] - '0') % mod;

    bool flag = false;
    for (int i = n / 3; i <= n / 2; i ++)
    {
        // if (check(i, n - i + 1) || check(i + 1, n - i + 1) || check(n - i * 2 + 2, n - i + 1) || check(n - i * 2 + 1, n - i + 1))
        //     return 0;
        if (check(i, n - i + 1) && i < ans.x) ans = PII(i, n - i + 1);
        if (check(i + 1, n - i + 1) && i + 1 < ans.x) ans = PII(i + 1, n - i + 1);
        if (check(n - i * 2 + 2, n - i + 1) && n - i * 2 + 2 < ans.x) ans = PII(n - i * 2 + 2, n - i + 1);
        if (check(n - i * 2 + 1, n - i + 1) && n - i * 2 + 1 < ans.x) ans = PII(n - i * 2 + 1, n - i + 1); 
    }
    print(ans.x, ans.y);
    
    return 0;
}