#include <bits/stdc++.h>
using namespace std;
string s;
int n, cnta, cntc, a[1000006];
long long mod = 998244353, mmod = 1000000007, s1[1000006], s2[1000006], x[1000006], xx[1000006];
long long ksm(long long p, long long q, long long m) {
	if (q == 0) return 1;
	if (q == 1) return p;
	if (q & 1) return ksm(p * p % m, q / 2, m) * p % m;
	return ksm(p * p % m, q / 2, m);
}
inline long long ge(int l, int r) {
	return ((s1[l] - s1[r + 1] + mod) % mod) * x[n - r] % mod;
}
inline long long gget(int l, int r) {
	return ((s2[l] - s2[r + 1] + mmod) % mmod) * xx[n - r] % mmod;
}
inline bool check( ) {
	return ((ge(1, cnta) + ge(cnta + 1, cntc - 1)) % mod == ge(cntc, n)) && ((gget(1, cnta) + gget(cnta + 1, cntc - 1)) % mmod == gget(cntc, n));
	return true;
}
inline void print() {
	for (int i = 1; i <= cnta; i++) {
		cout << a[i];
	}
	cout << "+";
	for (int i = cnta + 1; i < cntc; i++) {
		cout << a[i];
	}
	cout << "=";
	for (int i = cntc; i <= n; i++) {
		cout << a[i];
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> s;
	n = s.size();
	s = ' ' + s;
	long long b1 = 1, b2 = 1;
	for (int i = n; i >= 1; i--) {
		a[i] = s[i] - '0';
		s1[i] = (s1[i + 1] + a[i] * b1 % mod) % mod;
		s2[i] = (s2[i + 1] + a[i] * b2 % mmod) % mmod;
//		cout << s2[i] << " ";
		b1 = b1 * 10;
		b1 %= mod;
		b2 *= 10;
		b2 %= mmod;
	}
//	cout << endl;
	x[0] = xx[0] = 1;
	x[1] = ksm(10, mod - 2, mod);
	xx[1] = ksm(10, mmod - 2, mmod);
//	cout << xx[1] << endl;
	for (int i = 2; i <= n; i++) {
		x[i] = x[i - 1] * x[1] % mod;
		xx[i] = xx[i - 1] * xx[1] % mmod;
	}
	for (int i = 1; i <= n; i++) {
		cnta = i;
		if (n - i - i <= i && n - i - i >= 1) {
			cntc = n - i + 1;
			if (check()) {
				print();
				return 0;
			}
		}
		if (n - i - (i + 1) <= i && n - i - (i + 1) >= 1) {
			cntc = n - (i + 1) + 1;
			if (check()) {
				print();
				return 0;
			}
		}
		if ((n - i) / 2 >= 1) {
			cntc = n - (n - i + 1) / 2 + 1;
			if (check()) {
				print();
				return 0;
			}
		}
	}
}