// Problem: F. Restoring the Expression
// Contest: Codeforces - Codeforces Round 451 (Div. 2)
// URL: https://codeforces.com/problemset/problem/898/F
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 1e6 + 10, M = 1e6 + 10, mod1 = 10086001, mod2 = 998244353;

int n, m, q, ans;
int Hs1[N], Hs2[N], p1[N], p2[N];
string s;

// vector<int> e[N];

inline void init()
{
	p1[0] = p2[0] = 1;
	for(int i = 1; i <= n; i ++) p1[i] = p1[i - 1] * 10 % mod1, p2[i] = p2[i - 1] * 10 % mod2;
	for(int i = 1; i <= n; i ++) 
	{
		Hs1[i] = (Hs1[i - 1] * 10 + s[i] - '0') % mod1;
		Hs2[i] = (Hs2[i - 1] * 10 + s[i] - '0') % mod2;
	}
}

inline int calc1(int l, int r) {return ((Hs1[r] - Hs1[l - 1] * p1[r - l + 1]) % mod1 + mod1) % mod1;}
inline int calc2(int l, int r) {return ((Hs2[r] - Hs2[l - 1] * p2[r - l + 1]) % mod2 + mod2) % mod2;}

inline bool check(int l, int r)
{
	if(s[1] == '0' && l > 1) return false;
	if(s[l + 1] == '0' && r > l + 1) return false;
	if(s[r + 1] == '0' && n > r + 1) return false; 
	// cout << "ok0" << '\n';
	int suml1 = calc1(1, l), suml2 = calc2(1, l), sumr1 = calc1(l + 1, r), sumr2 = calc2(l + 1, r);
	int res1 = calc1(r + 1, n), res2 = calc2(r + 1, n);
	// cout << "l1 = " << suml1 << " l2 = " << suml2 << '\n';
	return (suml1 + sumr1) % mod1 == res1 && (suml2 + sumr2) % mod2 == res2;
	// int l1 = calc1(1, l), r1 = calc1(l + 1, r), res1 = calc1(r + 1, n);
	// return (l1 + r1) % mod1 == res1;
}

inline void print(int l, int r)
{
	for(int i = 1; i <= l; i ++) cout << s[i];
	cout << '+';
	for(int i = l + 1; i <= r; i ++) cout << s[i];
	cout << '=';
	for(int i = r + 1; i <= n; i ++) cout << s[i];
}

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> s; n = s.size(), s = ' ' + s;	
	init();
	for(int i = 1; i <= n; i ++)
	{
		if(n - i <= i) break;
		for(int j = min(n - i, (n + i) / 2); j > i; j --)
		{
			if(j - i > n - j) continue;
			if(n - j > max(i, j - i) + 1) break;
			// cout << "i = " << i << " j = " << j << '\n';
			if(check(i, j))
			{
				// cout << "ok" << '\n';
				print(i, j);
				return 0;
			}
		}
	}
	// cout << (check(9, 18) ? "YES" : "NO") << '\n';
	return 0;
}