#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const long double eps = 1e-8;
const int mod = 20999999;
const int maxn = 2e5 + 100;
const int N = 2e6 + 100;
const int M = (1 << 20) + 10;
template <class T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= c == '-';
  for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
  x = f ? -x : x;
}
template <class T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  T y = 1;
  int len = 1;
  for (; y <= x / 10; y *= 10) ++len;
  for (; len; --len, x %= y, y /= 10) putchar(x / y + 48);
}
long long qpow(long long a, long long b, long long mod) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    b >>= 1;
    a = (a * a) % mod;
  }
  return ans;
}
long long hs[N], pw[N];
int n;
char s[N];
inline long long get(int l, int r) {
  return (hs[r] - hs[l - 1] * pw[r - l + 1] % mod + mod) % mod;
}
bool check(int ad, int eq) {
  if (ad > eq) return 0;
  if (s[1] == '0' && ad != 2) return 0;
  if (s[ad] == '0' && eq != ad + 1) return 0;
  if (s[eq] == '0' && eq != n) return 0;
  long long tmp = (hs[ad - 1] + get(ad, eq - 1)) % mod;
  if (tmp != get(eq, n)) return 0;
  for (int i = 1; i <= n; ++i) {
    if (ad == i) cout << "+";
    if (eq == i) cout << "=";
    cout << s[i];
  }
  cout << "\n";
  return 1;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> (s + 1);
  n = strlen(s + 1);
  pw[0] = 1;
  for (int i = 1; i <= n; ++i) {
    hs[i] = (hs[i - 1] * 10 + s[i] - '0') % mod;
    pw[i] = pw[i - 1] * 10 % mod;
  }
  for (int i = 1; i * 2 <= n; ++i) {
    if (check(i + 1, n - i + 1)) return 0;
    if (check(i + 1, n - i)) return 0;
    if (check(n - i * 2 + 1, n - i + 1)) return 0;
    if (check(n - i * 2, n - i)) return 0;
  }
  return 0;
}
