import java.util.Scanner;

public class Main {

    static String[] OPR = { "+", "-" };

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String ABCD = sc.nextLine();

        String ans = solve(ABCD);
        System.out.println(ans);
    }

    private static String solve(String aBCD) {
        char[] abcd = aBCD.toCharArray();
        int a = Integer.parseInt(String.valueOf(aBCD.charAt(0)));
        int b = Integer.parseInt(String.valueOf(aBCD.charAt(1)));
        int c = Integer.parseInt(String.valueOf(aBCD.charAt(2)));
        int d = Integer.parseInt(String.valueOf(aBCD.charAt(3)));

        for (int i = 0; i < OPR.length; i++) {
            for (int j = 0; j < OPR.length; j++) {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            }
        }
        return null;
    }

    private static String makeFormula(int i, int j, int k, int a, int b, int c, int d) {
        StringBuilder sb = new StringBuilder();
        sb.append(a);
        sb.append(OPR[i]);
        sb.append(b);
        sb.append(OPR[j]);
        sb.append(c);
        sb.append(OPR[k]);
        sb.append(d);
        sb.append("=7");
        return sb.toString();
    }

    private static int sum(String term, int v1, int v2) {
        if (term.equals("+")) {
            return v1 + v2;
        } else {
            return v1 - v2;
        }
    }
} import java.util.Scanner; Scanner java.util public class Main {

    static String[] OPR = { "+", "-" };

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String ABCD = sc.nextLine();

        String ans = solve(ABCD);
        System.out.println(ans);
    }

    private static String solve(String aBCD) {
        char[] abcd = aBCD.toCharArray();
        int a = Integer.parseInt(String.valueOf(aBCD.charAt(0)));
        int b = Integer.parseInt(String.valueOf(aBCD.charAt(1)));
        int c = Integer.parseInt(String.valueOf(aBCD.charAt(2)));
        int d = Integer.parseInt(String.valueOf(aBCD.charAt(3)));

        for (int i = 0; i < OPR.length; i++) {
            for (int j = 0; j < OPR.length; j++) {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            }
        }
        return null;
    }

    private static String makeFormula(int i, int j, int k, int a, int b, int c, int d) {
        StringBuilder sb = new StringBuilder();
        sb.append(a);
        sb.append(OPR[i]);
        sb.append(b);
        sb.append(OPR[j]);
        sb.append(c);
        sb.append(OPR[k]);
        sb.append(d);
        sb.append("=7");
        return sb.toString();
    }

    private static int sum(String term, int v1, int v2) {
        if (term.equals("+")) {
            return v1 + v2;
        } else {
            return v1 - v2;
        }
    }
} Main static String[] OPR = { "+", "-" }; OPR { "+", "-" } "+" "-" public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String ABCD = sc.nextLine();

        String ans = solve(ABCD);
        System.out.println(ans);
    } main {
        Scanner sc = new Scanner(System.in);

        String ABCD = sc.nextLine();

        String ans = solve(ABCD);
        System.out.println(ans);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) String ABCD = sc.nextLine(); ABCD sc.nextLine() sc.nextLine sc String ans = solve(ABCD); ans solve(ABCD) solve ABCD System.out.println(ans) System.out.println System.out System System.out ans String[] args args private static String solve(String aBCD) {
        char[] abcd = aBCD.toCharArray();
        int a = Integer.parseInt(String.valueOf(aBCD.charAt(0)));
        int b = Integer.parseInt(String.valueOf(aBCD.charAt(1)));
        int c = Integer.parseInt(String.valueOf(aBCD.charAt(2)));
        int d = Integer.parseInt(String.valueOf(aBCD.charAt(3)));

        for (int i = 0; i < OPR.length; i++) {
            for (int j = 0; j < OPR.length; j++) {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            }
        }
        return null;
    } solve {
        char[] abcd = aBCD.toCharArray();
        int a = Integer.parseInt(String.valueOf(aBCD.charAt(0)));
        int b = Integer.parseInt(String.valueOf(aBCD.charAt(1)));
        int c = Integer.parseInt(String.valueOf(aBCD.charAt(2)));
        int d = Integer.parseInt(String.valueOf(aBCD.charAt(3)));

        for (int i = 0; i < OPR.length; i++) {
            for (int j = 0; j < OPR.length; j++) {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            }
        }
        return null;
    } char[] abcd = aBCD.toCharArray(); abcd aBCD.toCharArray() aBCD.toCharArray aBCD int a = Integer.parseInt(String.valueOf(aBCD.charAt(0))); a Integer.parseInt(String.valueOf(aBCD.charAt(0))) Integer.parseInt Integer String.valueOf(aBCD.charAt(0)) String.valueOf String aBCD.charAt(0) aBCD.charAt aBCD 0 int b = Integer.parseInt(String.valueOf(aBCD.charAt(1))); b Integer.parseInt(String.valueOf(aBCD.charAt(1))) Integer.parseInt Integer String.valueOf(aBCD.charAt(1)) String.valueOf String aBCD.charAt(1) aBCD.charAt aBCD 1 int c = Integer.parseInt(String.valueOf(aBCD.charAt(2))); c Integer.parseInt(String.valueOf(aBCD.charAt(2))) Integer.parseInt Integer String.valueOf(aBCD.charAt(2)) String.valueOf String aBCD.charAt(2) aBCD.charAt aBCD 2 int d = Integer.parseInt(String.valueOf(aBCD.charAt(3))); d Integer.parseInt(String.valueOf(aBCD.charAt(3))) Integer.parseInt Integer String.valueOf(aBCD.charAt(3)) String.valueOf String aBCD.charAt(3) aBCD.charAt aBCD 3 for (int i = 0; i < OPR.length; i++) {
            for (int j = 0; j < OPR.length; j++) {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            }
        } int i = 0; int i = 0; i 0 i < OPR.length i OPR.length OPR OPR.length i++ i++ i {
            for (int j = 0; j < OPR.length; j++) {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            }
        } {
            for (int j = 0; j < OPR.length; j++) {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            }
        } for (int j = 0; j < OPR.length; j++) {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            } int j = 0; int j = 0; j 0 j < OPR.length j OPR.length OPR OPR.length j++ j++ j {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            } {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            } for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                } int k = 0; int k = 0; k 0 k < OPR.length k OPR.length OPR OPR.length k++ k++ k {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                } {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                } int tmp = sum(OPR[i], a, b); tmp sum(OPR[i], a, b) sum OPR[i] OPR i a b tmp = sum(OPR[j], tmp, c) tmp sum(OPR[j], tmp, c) sum OPR[j] OPR j tmp c tmp = sum(OPR[k], tmp, d) tmp sum(OPR[k], tmp, d) sum OPR[k] OPR k tmp d if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    } tmp == 7 tmp 7 {
                        return makeFormula(i, j, k, a, b, c, d);
                    } return makeFormula(i, j, k, a, b, c, d); makeFormula(i, j, k, a, b, c, d) makeFormula i j k a b c d return null; null String aBCD aBCD private static String makeFormula(int i, int j, int k, int a, int b, int c, int d) {
        StringBuilder sb = new StringBuilder();
        sb.append(a);
        sb.append(OPR[i]);
        sb.append(b);
        sb.append(OPR[j]);
        sb.append(c);
        sb.append(OPR[k]);
        sb.append(d);
        sb.append("=7");
        return sb.toString();
    } makeFormula {
        StringBuilder sb = new StringBuilder();
        sb.append(a);
        sb.append(OPR[i]);
        sb.append(b);
        sb.append(OPR[j]);
        sb.append(c);
        sb.append(OPR[k]);
        sb.append(d);
        sb.append("=7");
        return sb.toString();
    } StringBuilder sb = new StringBuilder(); sb new StringBuilder() sb.append(a) sb.append sb a sb.append(OPR[i]) sb.append sb OPR[i] OPR i sb.append(b) sb.append sb b sb.append(OPR[j]) sb.append sb OPR[j] OPR j sb.append(c) sb.append sb c sb.append(OPR[k]) sb.append sb OPR[k] OPR k sb.append(d) sb.append sb d sb.append("=7") sb.append sb "=7" return sb.toString(); sb.toString() sb.toString sb int i i int j j int k k int a a int b b int c c int d d private static int sum(String term, int v1, int v2) {
        if (term.equals("+")) {
            return v1 + v2;
        } else {
            return v1 - v2;
        }
    } sum {
        if (term.equals("+")) {
            return v1 + v2;
        } else {
            return v1 - v2;
        }
    } if (term.equals("+")) {
            return v1 + v2;
        } else {
            return v1 - v2;
        } term.equals("+") term.equals term "+" {
            return v1 + v2;
        } return v1 + v2; v1 + v2 v1 v2 {
            return v1 - v2;
        } return v1 - v2; v1 - v2 v1 v2 String term term int v1 v1 int v2 v2 public class Main {

    static String[] OPR = { "+", "-" };

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String ABCD = sc.nextLine();

        String ans = solve(ABCD);
        System.out.println(ans);
    }

    private static String solve(String aBCD) {
        char[] abcd = aBCD.toCharArray();
        int a = Integer.parseInt(String.valueOf(aBCD.charAt(0)));
        int b = Integer.parseInt(String.valueOf(aBCD.charAt(1)));
        int c = Integer.parseInt(String.valueOf(aBCD.charAt(2)));
        int d = Integer.parseInt(String.valueOf(aBCD.charAt(3)));

        for (int i = 0; i < OPR.length; i++) {
            for (int j = 0; j < OPR.length; j++) {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            }
        }
        return null;
    }

    private static String makeFormula(int i, int j, int k, int a, int b, int c, int d) {
        StringBuilder sb = new StringBuilder();
        sb.append(a);
        sb.append(OPR[i]);
        sb.append(b);
        sb.append(OPR[j]);
        sb.append(c);
        sb.append(OPR[k]);
        sb.append(d);
        sb.append("=7");
        return sb.toString();
    }

    private static int sum(String term, int v1, int v2) {
        if (term.equals("+")) {
            return v1 + v2;
        } else {
            return v1 - v2;
        }
    }
} public class Main {

    static String[] OPR = { "+", "-" };

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String ABCD = sc.nextLine();

        String ans = solve(ABCD);
        System.out.println(ans);
    }

    private static String solve(String aBCD) {
        char[] abcd = aBCD.toCharArray();
        int a = Integer.parseInt(String.valueOf(aBCD.charAt(0)));
        int b = Integer.parseInt(String.valueOf(aBCD.charAt(1)));
        int c = Integer.parseInt(String.valueOf(aBCD.charAt(2)));
        int d = Integer.parseInt(String.valueOf(aBCD.charAt(3)));

        for (int i = 0; i < OPR.length; i++) {
            for (int j = 0; j < OPR.length; j++) {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            }
        }
        return null;
    }

    private static String makeFormula(int i, int j, int k, int a, int b, int c, int d) {
        StringBuilder sb = new StringBuilder();
        sb.append(a);
        sb.append(OPR[i]);
        sb.append(b);
        sb.append(OPR[j]);
        sb.append(c);
        sb.append(OPR[k]);
        sb.append(d);
        sb.append("=7");
        return sb.toString();
    }

    private static int sum(String term, int v1, int v2) {
        if (term.equals("+")) {
            return v1 + v2;
        } else {
            return v1 - v2;
        }
    }
} Main
import java.util.Scanner;

public class Main {

    static String[] OPR = { "+", "-" };

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String ABCD = sc.nextLine();

        String ans = solve(ABCD);
        System.out.println(ans);
    }

    private static String solve(String aBCD) {
        char[] abcd = aBCD.toCharArray();
        int a = Integer.parseInt(String.valueOf(aBCD.charAt(0)));
        int b = Integer.parseInt(String.valueOf(aBCD.charAt(1)));
        int c = Integer.parseInt(String.valueOf(aBCD.charAt(2)));
        int d = Integer.parseInt(String.valueOf(aBCD.charAt(3)));

        for (int i = 0; i < OPR.length; i++) {
            for (int j = 0; j < OPR.length; j++) {
                for (int k = 0; k < OPR.length; k++) {
                    int tmp = sum(OPR[i], a, b);
                    tmp = sum(OPR[j], tmp, c);
                    tmp = sum(OPR[k], tmp, d);
                    if (tmp == 7) {
                        return makeFormula(i, j, k, a, b, c, d);
                    }
                }
            }
        }
        return null;
    }

    private static String makeFormula(int i, int j, int k, int a, int b, int c, int d) {
        StringBuilder sb = new StringBuilder();
        sb.append(a);
        sb.append(OPR[i]);
        sb.append(b);
        sb.append(OPR[j]);
        sb.append(c);
        sb.append(OPR[k]);
        sb.append(d);
        sb.append("=7");
        return sb.toString();
    }

    private static int sum(String term, int v1, int v2) {
        if (term.equals("+")) {
            return v1 + v2;
        } else {
            return v1 - v2;
        }
    }
}
