#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long n, long long mod) {
  if (a == 0) return 0;
  if (a == 1 || n == 0) return 1;
  if (n == 1) return a % mod;
  long long t = power(a, n / 2, mod);
  t = t * t % mod;
  if (n & 1) return t * a % mod;
  return t;
}
int popcount(long long a) {
  int c = 0;
  while (a) {
    c++;
    a -= a & -a;
  }
  return c;
}
void factorize(int a) {}
void update(int tree[], int idx, int val, int maxval) {
  for (; idx <= maxval; idx += idx & -idx) {
    tree[idx] += val;
  }
}
int read(int tree[], int idx) {
  long long sum = 0;
  for (; idx > 0; idx -= idx & -idx) {
    sum += tree[idx];
  }
  return sum;
}
struct node2 {
  int id, val;
  node2() {
    static int ctx = 0;
    id = ctx++;
  };
  node2(int a, int b = 0, int c = 0, int d = 0, int e = 0, int f = 0) {
    val = a;
  }
};
struct comp2 {
  bool operator()(int a, int b) { return b < a; }
};
bool cmp2(int a, int b) { return b < a; }
struct node {
  int id, val;
  node() {
    static int ctx = 0;
    id = ctx++;
  };
  node(int a, int b = 0, int c = 0, int d = 0, int e = 0, int f = 0) {
    val = a;
  }
};
struct comp {
  bool operator()(int a, int b) { return b < a; }
};
bool cmp(int a, int b) { return b < a; }
int n, m, a, b, c, d, edge, k, h, w, x, y, p, q, t, ans1, ans2, ans3, res, ma,
    mi, T, act = 0, pas = 1, cur, flag, now;
int dp, dp2, cnt;
long long mod[3], f[3][1000009], roll[3][1000009], inv[3][1000009];
char s[1000009];
double e, z;
vector<int> v, vec;
set<int> sett;
map<int, int> mapp;
void print() {}
void print2() {}
void input() {
  scanf("%s", s);
  n = strlen(s);
}
void inity(int idx) {
  for (int i = n - 1; i > -1; i--) {
    roll[idx][i] = (s[i] - '0') * f[idx][n - 1 - i] % mod[idx];
    roll[idx][i] = (roll[idx][i] + roll[idx][i + 1]) % mod[idx];
  }
}
inline bool check(int l1, int l2, int l3) {
  if (l1 <= 0 || l2 <= 0 || l3 <= 0) return false;
  if (l3 < l1 || l3 < l2) return false;
  if (l1 > 1 && s[0] == '0' || l2 > 1 && s[l1] == '0' ||
      l3 > 1 && s[l1 + l2] == '0')
    return false;
  if (l3 - l1 <= 1 || l3 - l2 <= 1) return true;
  return false;
}
inline bool calc(int l1, int l2, int l3, int idx) {
  long long v1 =
      (roll[idx][0] - roll[idx][l1] + mod[idx]) * inv[idx][n - l1] % mod[idx];
  long long v2 = (roll[idx][l1] - roll[idx][l1 + l2] + mod[idx]) *
                 inv[idx][n - l1 - l2] % mod[idx];
  long long v3 = roll[idx][l1 + l2];
  return (v1 + v2) % mod[idx] == v3;
}
void solve() {
  mod[0] = 1000000007;
  mod[1] = 1000000009;
  mod[2] = 97;
  for (int j = 0; j < 3; j++) {
    f[j][0] = 1;
    for (int i = 1; i < n + 1; i++) f[j][i] = f[j][i - 1] * 10 % mod[j];
    inv[j][n] = power(f[j][n], mod[j] - 2, mod[j]);
    for (int i = n - 1; i > -1; i--) inv[j][i] = inv[j][i + 1] * 10 % mod[j];
    inity(j);
  }
  for (int len1 = 1; len1 < n / 2 + 1; len1++) {
    if (2 * len1 <= n - len1) {
      int len2 = (n - len1) / 2;
      for (int j = -2; j < 3; j++) {
        if (check(len1, len2 + j, n - len1 - len2 - j)) {
          int flag = 0;
          for (int idx = 0; idx < 3; idx++) {
            flag += calc(len1, len2 + j, n - len1 - len2 - j, idx);
          }
          if (flag == 3) {
            ans1 = len1;
            ans2 = len2 + j;
            ans3 = n - len1 - len2 - j;
            break;
          }
        }
      }
    } else {
      for (int j = 0; j < 2; j++) {
        if (check(len1, n - 2 * len1 - j, len1 + j)) {
          int flag = 0;
          for (int idx = 0; idx < 3; idx++) {
            flag += calc(len1, n - 2 * len1 - j, len1 + j, idx);
          }
          if (flag == 3) {
            ans1 = len1;
            ans2 = n - 2 * len1 - j;
            ans3 = len1 + j;
            break;
          }
        }
      }
    }
  }
}
void output() {
  k = n + 1;
  for (int i = n - 1; i > n - ans3 - 1; i--) s[k--] = s[i];
  s[k--] = '=';
  for (int i = n - ans3 - 1; i > n - ans3 - ans2 - 1; i--) s[k--] = s[i];
  s[k--] = '+';
  for (int i = n - ans3 - ans2 - 1; i > -1; i--) s[k--] = s[i];
  printf("%s", s);
}
int main() {
  input();
  solve();
  output();
  return 0;
}
