/**
 * Created at 04:10 on 2019-08-16
 */

import java.io.*;
import java.util.*;

public class Main {

  static FastScanner sc = new FastScanner();
  static Output out = new Output(System.out);

  static final int[] dx = {0, 1, 0, -1};
  static final int[] dy = {-1, 0, 1, 0};

  static final long MOD = (long) (1e9 + 7);
  static final long INF = Long.MAX_VALUE / 2;

  public static class Solver {
    public Solver() {

      String S = sc.next();
      int[] nums = new int[4];
      long sum = 0;
      for (int i=0; i<4; i++) {
        nums[i] = S.charAt(i) - '0';
        sum += nums[i];
      }

      for (Bit bit = new Bit(); !bit.get(3); bit.next()) {
        long ans = sum;
        for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        }
        if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        }
      }

    }

    public class Bit extends BitSet {

      public void set(long l) {
        clear();
        for (int i=0; i<64; i++) {
          if (((l>>i)&1) == 1) set(i, true);
        }
      }

      public long toLong() {
        long res = 0;
        for (int i = nextSetBit(0); i >= 0; i = nextSetBit(i+1)) {
          res += 1<<i;
        }
        return res;
      }

      public void next() {
        for (int i=0; ; i++) {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        }
      }

    }

  }

  public static void main(String[] args) {
    new Solver();
    out.flush();
  }

  static class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  }

  static class Output extends PrintWriter {

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }
  }

} import java.io.*; io.* java import java.util.*; util.* java public class Main {

  static FastScanner sc = new FastScanner();
  static Output out = new Output(System.out);

  static final int[] dx = {0, 1, 0, -1};
  static final int[] dy = {-1, 0, 1, 0};

  static final long MOD = (long) (1e9 + 7);
  static final long INF = Long.MAX_VALUE / 2;

  public static class Solver {
    public Solver() {

      String S = sc.next();
      int[] nums = new int[4];
      long sum = 0;
      for (int i=0; i<4; i++) {
        nums[i] = S.charAt(i) - '0';
        sum += nums[i];
      }

      for (Bit bit = new Bit(); !bit.get(3); bit.next()) {
        long ans = sum;
        for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        }
        if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        }
      }

    }

    public class Bit extends BitSet {

      public void set(long l) {
        clear();
        for (int i=0; i<64; i++) {
          if (((l>>i)&1) == 1) set(i, true);
        }
      }

      public long toLong() {
        long res = 0;
        for (int i = nextSetBit(0); i >= 0; i = nextSetBit(i+1)) {
          res += 1<<i;
        }
        return res;
      }

      public void next() {
        for (int i=0; ; i++) {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        }
      }

    }

  }

  public static void main(String[] args) {
    new Solver();
    out.flush();
  }

  static class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  }

  static class Output extends PrintWriter {

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }
  }

} Main static FastScanner sc = new FastScanner(); sc new FastScanner() static Output out = new Output(System.out); out new Output(System.out) static final int[] dx = {0, 1, 0, -1}; dx {0, 1, 0, -1} 0 1 0 -1 1 static final int[] dy = {-1, 0, 1, 0}; dy {-1, 0, 1, 0} -1 1 0 1 0 static final long MOD = (long) (1e9 + 7); MOD (long) (1e9 + 7) 1e9 7 static final long INF = Long.MAX_VALUE / 2; INF Long.MAX_VALUE / 2 Long.MAX_VALUE Long Long.MAX_VALUE 2 public static void main(String[] args) {
    new Solver();
    out.flush();
  } main {
    new Solver();
    out.flush();
  } new Solver() out.flush() out.flush out String[] args args public static class Solver {
    public Solver() {

      String S = sc.next();
      int[] nums = new int[4];
      long sum = 0;
      for (int i=0; i<4; i++) {
        nums[i] = S.charAt(i) - '0';
        sum += nums[i];
      }

      for (Bit bit = new Bit(); !bit.get(3); bit.next()) {
        long ans = sum;
        for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        }
        if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        }
      }

    }

    public class Bit extends BitSet {

      public void set(long l) {
        clear();
        for (int i=0; i<64; i++) {
          if (((l>>i)&1) == 1) set(i, true);
        }
      }

      public long toLong() {
        long res = 0;
        for (int i = nextSetBit(0); i >= 0; i = nextSetBit(i+1)) {
          res += 1<<i;
        }
        return res;
      }

      public void next() {
        for (int i=0; ; i++) {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        }
      }

    }

  } Solver public Solver() {

      String S = sc.next();
      int[] nums = new int[4];
      long sum = 0;
      for (int i=0; i<4; i++) {
        nums[i] = S.charAt(i) - '0';
        sum += nums[i];
      }

      for (Bit bit = new Bit(); !bit.get(3); bit.next()) {
        long ans = sum;
        for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        }
        if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        }
      }

    } Solver {

      String S = sc.next();
      int[] nums = new int[4];
      long sum = 0;
      for (int i=0; i<4; i++) {
        nums[i] = S.charAt(i) - '0';
        sum += nums[i];
      }

      for (Bit bit = new Bit(); !bit.get(3); bit.next()) {
        long ans = sum;
        for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        }
        if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        }
      }

    } String S = sc.next(); S sc.next() sc.next sc int[] nums = new int[4]; nums new int[4] 4 long sum = 0; sum 0 for (int i=0; i<4; i++) {
        nums[i] = S.charAt(i) - '0';
        sum += nums[i];
      } int i=0; int i=0; i 0 i<4 i 4 i++ i++ i {
        nums[i] = S.charAt(i) - '0';
        sum += nums[i];
      } {
        nums[i] = S.charAt(i) - '0';
        sum += nums[i];
      } nums[i] = S.charAt(i) - '0' nums[i] nums i S.charAt(i) - '0' S.charAt(i) S.charAt S i '0' sum += nums[i] sum nums[i] nums i for (Bit bit = new Bit(); !bit.get(3); bit.next()) {
        long ans = sum;
        for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        }
        if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        }
      } Bit bit = new Bit(); Bit bit = new Bit(); bit new Bit() !bit.get(3) bit.get(3) bit.get bit 3 bit.next() bit.next() bit.next bit {
        long ans = sum;
        for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        }
        if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        }
      } {
        long ans = sum;
        for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        }
        if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        }
      } long ans = sum; ans sum for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        } int i = bit.nextSetBit(0); int i = bit.nextSetBit(0); i bit.nextSetBit(0) bit.nextSetBit bit 0 i>=0 i 0 i=bit.nextSetBit(i+1) i=bit.nextSetBit(i+1) i bit.nextSetBit(i+1) bit.nextSetBit bit i+1 i 1 {
          ans -= 2 * nums[i+1];
        } {
          ans -= 2 * nums[i+1];
        } ans -= 2 * nums[i+1] ans 2 * nums[i+1] 2 nums[i+1] nums i+1 i 1 if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        } ans == 7 ans 7 {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        } out.print(nums[0]) out.print out nums[0] nums 0 for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          } int i=0; int i=0; i 0 i<3 i 3 i++ i++ i {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          } {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          } out.print(bit.get(i) ? "-" : "+") out.print out bit.get(i) ? "-" : "+" bit.get(i) bit.get bit i "-" "+" out.print(nums[i+1]) out.print out nums[i+1] nums i+1 i 1 out.println("=7") out.println out "=7" return; public class Bit extends BitSet {

      public void set(long l) {
        clear();
        for (int i=0; i<64; i++) {
          if (((l>>i)&1) == 1) set(i, true);
        }
      }

      public long toLong() {
        long res = 0;
        for (int i = nextSetBit(0); i >= 0; i = nextSetBit(i+1)) {
          res += 1<<i;
        }
        return res;
      }

      public void next() {
        for (int i=0; ; i++) {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        }
      }

    } Bit public void set(long l) {
        clear();
        for (int i=0; i<64; i++) {
          if (((l>>i)&1) == 1) set(i, true);
        }
      } set {
        clear();
        for (int i=0; i<64; i++) {
          if (((l>>i)&1) == 1) set(i, true);
        }
      } clear() clear for (int i=0; i<64; i++) {
          if (((l>>i)&1) == 1) set(i, true);
        } int i=0; int i=0; i 0 i<64 i 64 i++ i++ i {
          if (((l>>i)&1) == 1) set(i, true);
        } {
          if (((l>>i)&1) == 1) set(i, true);
        } if (((l>>i)&1) == 1) set(i, true); ((l>>i)&1) == 1 ((l>>i)&1) (l>>i) l i 1 1 set(i, true) set i true long l l public long toLong() {
        long res = 0;
        for (int i = nextSetBit(0); i >= 0; i = nextSetBit(i+1)) {
          res += 1<<i;
        }
        return res;
      } toLong {
        long res = 0;
        for (int i = nextSetBit(0); i >= 0; i = nextSetBit(i+1)) {
          res += 1<<i;
        }
        return res;
      } long res = 0; res 0 for (int i = nextSetBit(0); i >= 0; i = nextSetBit(i+1)) {
          res += 1<<i;
        } int i = nextSetBit(0); int i = nextSetBit(0); i nextSetBit(0) nextSetBit 0 i >= 0 i 0 i = nextSetBit(i+1) i = nextSetBit(i+1) i nextSetBit(i+1) nextSetBit i+1 i 1 {
          res += 1<<i;
        } {
          res += 1<<i;
        } res += 1<<i res 1<<i 1 i return res; res public void next() {
        for (int i=0; ; i++) {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        }
      } next {
        for (int i=0; ; i++) {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        }
      } for (int i=0; ; i++) {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        } int i=0; int i=0; i 0 i++ i++ i {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        } {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        } if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          } get(i) get i {
            set(i, false);
          } set(i, false) set i false {
            set(i, true);
            break;
          } set(i, true) set i true break; BitSet static class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  } FastScanner private final InputStream in = System.in; in System.in System System.in private final byte[] buffer = new byte[1024]; buffer new byte[1024] 1024 private int ptr = 0; ptr 0 private int buflen = 0; buflen 0 private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    } hasNextByte {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    } if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      } ptr < buflen ptr buflen {
        return true;
      } return true; true {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      } ptr = 0 ptr 0 try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        } catch (IOException e) {
          e.printStackTrace();
        } IOException e {
          e.printStackTrace();
        } e.printStackTrace() e.printStackTrace e {
          buflen = in.read(buffer);
        } buflen = in.read(buffer) buflen in.read(buffer) in.read in buffer if (buflen <= 0) {
          return false;
        } buflen <= 0 buflen 0 {
          return false;
        } return false; false return true; true private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    } readByte {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    } if (hasNextByte()) return buffer[ptr++];
      else return -1; hasNextByte() hasNextByte return buffer[ptr++]; buffer[ptr++] buffer ptr++ ptr return -1; -1 1 private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    } isPrintableChar {
      return 33 <= c && c <= 126;
    } return 33 <= c && c <= 126; 33 <= c && c <= 126 33 <= c 33 c c <= 126 c 126 int c c private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    } skipUnprintable {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    } while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; hasNextByte() && !isPrintableChar(buffer[ptr]) hasNextByte() hasNextByte !isPrintableChar(buffer[ptr]) isPrintableChar(buffer[ptr]) isPrintableChar buffer[ptr] buffer ptr ptr++ ptr public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    } hasNext {
      skipUnprintable();
      return hasNextByte();
    } skipUnprintable() skipUnprintable return hasNextByte(); hasNextByte() hasNextByte public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    } next {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    } if (!hasNext()) throw new NoSuchElementException(); !hasNext() hasNext() hasNext throw new NoSuchElementException(); new NoSuchElementException() StringBuilder sb = new StringBuilder(); sb new StringBuilder() int b = readByte(); b readByte() readByte while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      } isPrintableChar(b) isPrintableChar b {
        sb.appendCodePoint(b);
        b = readByte();
      } sb.appendCodePoint(b) sb.appendCodePoint sb b b = readByte() b readByte() readByte return sb.toString(); sb.toString() sb.toString sb public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    } nextLong {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    } if (!hasNext()) throw new NoSuchElementException(); !hasNext() hasNext() hasNext throw new NoSuchElementException(); new NoSuchElementException() long n = 0; n 0 boolean minus = false; minus false int b = readByte(); b readByte() readByte if (b == '-') {
        minus = true;
        b = readByte();
      } b == '-' b '-' {
        minus = true;
        b = readByte();
      } minus = true minus true b = readByte() b readByte() readByte if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      } b < '0' || '9' < b b < '0' b '0' '9' < b '9' b {
        throw new NumberFormatException();
      } throw new NumberFormatException(); new NumberFormatException() while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      } true {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      } if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        } '0' <= b && b <= '9' '0' <= b '0' b b <= '9' b '9' {
          n *= 10;
          n += b - '0';
        } n *= 10 n 10 n += b - '0' n b - '0' b '0' if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        } b == -1 || !isPrintableChar(b) b == -1 b -1 1 !isPrintableChar(b) isPrintableChar(b) isPrintableChar b {
          return minus ? -n : n;
        } return minus ? -n : n; minus ? -n : n minus -n n n {
          throw new NumberFormatException();
        } throw new NumberFormatException(); new NumberFormatException() b = readByte() b readByte() readByte public int nextInt() {
      return (int) nextLong();
    } nextInt {
      return (int) nextLong();
    } return (int) nextLong(); (int) nextLong() nextLong public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    } nextIntArray {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    } if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } oneBased {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } int[] array = new int[N + 1]; array new int[N + 1] N + 1 N 1 for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        } int i = 1; int i = 1; i 1 i <= N i N i++ i++ i {
          array[i] = sc.nextInt();
        } {
          array[i] = sc.nextInt();
        } array[i] = sc.nextInt() array[i] array i sc.nextInt() sc.nextInt sc return array; array {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } int[] array = new int[N]; array new int[N] N for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
          array[i] = sc.nextInt();
        } {
          array[i] = sc.nextInt();
        } array[i] = sc.nextInt() array[i] array i sc.nextInt() sc.nextInt sc return array; array int N N boolean oneBased oneBased public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    } nextLongArray {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    } if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } oneBased {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } long[] array = new long[N + 1]; array new long[N + 1] N + 1 N 1 for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        } int i = 1; int i = 1; i 1 i <= N i N i++ i++ i {
          array[i] = sc.nextLong();
        } {
          array[i] = sc.nextLong();
        } array[i] = sc.nextLong() array[i] array i sc.nextLong() sc.nextLong sc return array; array {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } long[] array = new long[N]; array new long[N] N for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
          array[i] = sc.nextLong();
        } {
          array[i] = sc.nextLong();
        } array[i] = sc.nextLong() array[i] array i sc.nextLong() sc.nextLong sc return array; array int N N boolean oneBased oneBased static class Output extends PrintWriter {

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }
  } Output public Output(PrintStream ps) {
      super(ps);
    } Output {
      super(ps);
    } super(ps) super ps PrintStream ps ps public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } print {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } int i = 0; int i = 0; i 0 i < a.length i a.length a a.length i++ i++ i {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } if (i == 0) print(a[i]);
        else print(separator + a[i]); i == 0 i 0 print(a[i]) print a[i] a i print(separator + a[i]) print separator + a[i] separator a[i] a i println() println int[] a a String separator separator public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } print {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } int i = 0; int i = 0; i 0 i < a.length i a.length a a.length i++ i++ i {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } if (i == 0) print(a[i]);
        else print(separator + a[i]); i == 0 i 0 print(a[i]) print a[i] a i print(separator + a[i]) print separator + a[i] separator a[i] a i println() println long[] a a String separator separator public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } print {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } int i = 0; int i = 0; i 0 i < a.length i a.length a a.length i++ i++ i {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } if (i == 0) print(a[i]);
        else print(separator + a[i]); i == 0 i 0 print(a[i]) print a[i] a i print(separator + a[i]) print separator + a[i] separator a[i] a i println() println String[] a a String separator separator public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    } print {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    } for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      } int i = 0; int i = 0; i 0 i < a.size() i a.size() a.size a i++ i++ i {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      } {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      } if (i == 0) print(a.get(i));
        else print(separator + a.get(i)); i == 0 i 0 print(a.get(i)) print a.get(i) a.get a i print(separator + a.get(i)) print separator + a.get(i) separator a.get(i) a.get a i println() println ArrayList a a String separator separator PrintWriter public class Main {

  static FastScanner sc = new FastScanner();
  static Output out = new Output(System.out);

  static final int[] dx = {0, 1, 0, -1};
  static final int[] dy = {-1, 0, 1, 0};

  static final long MOD = (long) (1e9 + 7);
  static final long INF = Long.MAX_VALUE / 2;

  public static class Solver {
    public Solver() {

      String S = sc.next();
      int[] nums = new int[4];
      long sum = 0;
      for (int i=0; i<4; i++) {
        nums[i] = S.charAt(i) - '0';
        sum += nums[i];
      }

      for (Bit bit = new Bit(); !bit.get(3); bit.next()) {
        long ans = sum;
        for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        }
        if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        }
      }

    }

    public class Bit extends BitSet {

      public void set(long l) {
        clear();
        for (int i=0; i<64; i++) {
          if (((l>>i)&1) == 1) set(i, true);
        }
      }

      public long toLong() {
        long res = 0;
        for (int i = nextSetBit(0); i >= 0; i = nextSetBit(i+1)) {
          res += 1<<i;
        }
        return res;
      }

      public void next() {
        for (int i=0; ; i++) {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        }
      }

    }

  }

  public static void main(String[] args) {
    new Solver();
    out.flush();
  }

  static class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  }

  static class Output extends PrintWriter {

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }
  }

} public class Main {

  static FastScanner sc = new FastScanner();
  static Output out = new Output(System.out);

  static final int[] dx = {0, 1, 0, -1};
  static final int[] dy = {-1, 0, 1, 0};

  static final long MOD = (long) (1e9 + 7);
  static final long INF = Long.MAX_VALUE / 2;

  public static class Solver {
    public Solver() {

      String S = sc.next();
      int[] nums = new int[4];
      long sum = 0;
      for (int i=0; i<4; i++) {
        nums[i] = S.charAt(i) - '0';
        sum += nums[i];
      }

      for (Bit bit = new Bit(); !bit.get(3); bit.next()) {
        long ans = sum;
        for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        }
        if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        }
      }

    }

    public class Bit extends BitSet {

      public void set(long l) {
        clear();
        for (int i=0; i<64; i++) {
          if (((l>>i)&1) == 1) set(i, true);
        }
      }

      public long toLong() {
        long res = 0;
        for (int i = nextSetBit(0); i >= 0; i = nextSetBit(i+1)) {
          res += 1<<i;
        }
        return res;
      }

      public void next() {
        for (int i=0; ; i++) {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        }
      }

    }

  }

  public static void main(String[] args) {
    new Solver();
    out.flush();
  }

  static class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  }

  static class Output extends PrintWriter {

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }
  }

} Main
/**
 * Created at 04:10 on 2019-08-16
 */

import java.io.*;
import java.util.*;

public class Main {

  static FastScanner sc = new FastScanner();
  static Output out = new Output(System.out);

  static final int[] dx = {0, 1, 0, -1};
  static final int[] dy = {-1, 0, 1, 0};

  static final long MOD = (long) (1e9 + 7);
  static final long INF = Long.MAX_VALUE / 2;

  public static class Solver {
    public Solver() {

      String S = sc.next();
      int[] nums = new int[4];
      long sum = 0;
      for (int i=0; i<4; i++) {
        nums[i] = S.charAt(i) - '0';
        sum += nums[i];
      }

      for (Bit bit = new Bit(); !bit.get(3); bit.next()) {
        long ans = sum;
        for (int i = bit.nextSetBit(0); i>=0; i=bit.nextSetBit(i+1)) {
          ans -= 2 * nums[i+1];
        }
        if (ans == 7) {
          out.print(nums[0]);
          for (int i=0; i<3; i++) {
            out.print(bit.get(i) ? "-" : "+");
            out.print(nums[i+1]);
          }
          out.println("=7");
          return;
        }
      }

    }

    public class Bit extends BitSet {

      public void set(long l) {
        clear();
        for (int i=0; i<64; i++) {
          if (((l>>i)&1) == 1) set(i, true);
        }
      }

      public long toLong() {
        long res = 0;
        for (int i = nextSetBit(0); i >= 0; i = nextSetBit(i+1)) {
          res += 1<<i;
        }
        return res;
      }

      public void next() {
        for (int i=0; ; i++) {
          if (get(i)) {
            set(i, false);
          } else {
            set(i, true);
            break;
          }
        }
      }

    }

  }

  public static void main(String[] args) {
    new Solver();
    out.flush();
  }

  static class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  }

  static class Output extends PrintWriter {

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }
  }

}
