import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        char[] arr = scanner.next().toCharArray();
        scanner.close();

        char[] op = new char[arr.length - 1];

        // bit全探索
        // 集合 (1, 2, 3) の部分集合(1, 12, 123 など) の種類で回す (2のn乗 == Math.pow(2, S.length()))
        for (int i = 0; i < (1 << arr.length - 1); i++) {
            int total = arr[0] - '0';
            for (int j = 0; j < arr.length - 1; j++) {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            }
            if (total == 7) {
                break;
            }
        }

        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]);
            if (i < op.length) {
                System.out.print(op[i]);
            }
        }
        System.out.print("=7");
    }
} import java.util.Scanner; Scanner java.util public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        char[] arr = scanner.next().toCharArray();
        scanner.close();

        char[] op = new char[arr.length - 1];

        // bit全探索
        // 集合 (1, 2, 3) の部分集合(1, 12, 123 など) の種類で回す (2のn乗 == Math.pow(2, S.length()))
        for (int i = 0; i < (1 << arr.length - 1); i++) {
            int total = arr[0] - '0';
            for (int j = 0; j < arr.length - 1; j++) {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            }
            if (total == 7) {
                break;
            }
        }

        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]);
            if (i < op.length) {
                System.out.print(op[i]);
            }
        }
        System.out.print("=7");
    }
} Main public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        char[] arr = scanner.next().toCharArray();
        scanner.close();

        char[] op = new char[arr.length - 1];

        // bit全探索
        // 集合 (1, 2, 3) の部分集合(1, 12, 123 など) の種類で回す (2のn乗 == Math.pow(2, S.length()))
        for (int i = 0; i < (1 << arr.length - 1); i++) {
            int total = arr[0] - '0';
            for (int j = 0; j < arr.length - 1; j++) {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            }
            if (total == 7) {
                break;
            }
        }

        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]);
            if (i < op.length) {
                System.out.print(op[i]);
            }
        }
        System.out.print("=7");
    } main {
        Scanner scanner = new Scanner(System.in);
        char[] arr = scanner.next().toCharArray();
        scanner.close();

        char[] op = new char[arr.length - 1];

        // bit全探索
        // 集合 (1, 2, 3) の部分集合(1, 12, 123 など) の種類で回す (2のn乗 == Math.pow(2, S.length()))
        for (int i = 0; i < (1 << arr.length - 1); i++) {
            int total = arr[0] - '0';
            for (int j = 0; j < arr.length - 1; j++) {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            }
            if (total == 7) {
                break;
            }
        }

        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]);
            if (i < op.length) {
                System.out.print(op[i]);
            }
        }
        System.out.print("=7");
    } Scanner scanner = new Scanner(System.in); scanner new Scanner(System.in) char[] arr = scanner.next().toCharArray(); arr scanner.next().toCharArray() scanner.next().toCharArray scanner.next() scanner.next scanner scanner.close() scanner.close scanner char[] op = new char[arr.length - 1]; op new char[arr.length - 1] arr.length - 1 arr.length arr arr.length 1 for (int i = 0; i < (1 << arr.length - 1); i++) {
            int total = arr[0] - '0';
            for (int j = 0; j < arr.length - 1; j++) {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            }
            if (total == 7) {
                break;
            }
        } int i = 0; int i = 0; i 0 i < (1 << arr.length - 1) i (1 << arr.length - 1) 1 arr.length - 1 arr.length arr arr.length 1 i++ i++ i {
            int total = arr[0] - '0';
            for (int j = 0; j < arr.length - 1; j++) {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            }
            if (total == 7) {
                break;
            }
        } {
            int total = arr[0] - '0';
            for (int j = 0; j < arr.length - 1; j++) {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            }
            if (total == 7) {
                break;
            }
        } int total = arr[0] - '0'; total arr[0] - '0' arr[0] arr 0 '0' for (int j = 0; j < arr.length - 1; j++) {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            } int j = 0; int j = 0; j 0 j < arr.length - 1 j arr.length - 1 arr.length arr arr.length 1 j++ j++ j {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            } {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            } if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                } ((i >> j) & 1) == 1 ((i >> j) & 1) (i >> j) i j 1 1 {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } op[j] = '+' op[j] op j '+' total += arr[j + 1] - '0' total arr[j + 1] - '0' arr[j + 1] arr j + 1 j 1 '0' {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                } op[j] = '-' op[j] op j '-' total -= arr[j + 1] - '0' total arr[j + 1] - '0' arr[j + 1] arr j + 1 j 1 '0' if (total == 7) {
                break;
            } total == 7 total 7 {
                break;
            } break; for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]);
            if (i < op.length) {
                System.out.print(op[i]);
            }
        } int i = 0; int i = 0; i 0 i < arr.length i arr.length arr arr.length i++ i++ i {
            System.out.print(arr[i]);
            if (i < op.length) {
                System.out.print(op[i]);
            }
        } {
            System.out.print(arr[i]);
            if (i < op.length) {
                System.out.print(op[i]);
            }
        } System.out.print(arr[i]) System.out.print System.out System System.out arr[i] arr i if (i < op.length) {
                System.out.print(op[i]);
            } i < op.length i op.length op op.length {
                System.out.print(op[i]);
            } System.out.print(op[i]) System.out.print System.out System System.out op[i] op i System.out.print("=7") System.out.print System.out System System.out "=7" String[] args args public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        char[] arr = scanner.next().toCharArray();
        scanner.close();

        char[] op = new char[arr.length - 1];

        // bit全探索
        // 集合 (1, 2, 3) の部分集合(1, 12, 123 など) の種類で回す (2のn乗 == Math.pow(2, S.length()))
        for (int i = 0; i < (1 << arr.length - 1); i++) {
            int total = arr[0] - '0';
            for (int j = 0; j < arr.length - 1; j++) {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            }
            if (total == 7) {
                break;
            }
        }

        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]);
            if (i < op.length) {
                System.out.print(op[i]);
            }
        }
        System.out.print("=7");
    }
} public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        char[] arr = scanner.next().toCharArray();
        scanner.close();

        char[] op = new char[arr.length - 1];

        // bit全探索
        // 集合 (1, 2, 3) の部分集合(1, 12, 123 など) の種類で回す (2のn乗 == Math.pow(2, S.length()))
        for (int i = 0; i < (1 << arr.length - 1); i++) {
            int total = arr[0] - '0';
            for (int j = 0; j < arr.length - 1; j++) {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            }
            if (total == 7) {
                break;
            }
        }

        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]);
            if (i < op.length) {
                System.out.print(op[i]);
            }
        }
        System.out.print("=7");
    }
} Main
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        char[] arr = scanner.next().toCharArray();
        scanner.close();

        char[] op = new char[arr.length - 1];

        // bit全探索
        // 集合 (1, 2, 3) の部分集合(1, 12, 123 など) の種類で回す (2のn乗 == Math.pow(2, S.length()))
        for (int i = 0; i < (1 << arr.length - 1); i++) {
            int total = arr[0] - '0';
            for (int j = 0; j < arr.length - 1; j++) {
                if (((i >> j) & 1) == 1) {
                    op[j] = '+';
                    total += arr[j + 1] - '0';
                } else {
                    op[j] = '-';
                    total -= arr[j + 1] - '0';
                }
            }
            if (total == 7) {
                break;
            }
        }

        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i]);
            if (i < op.length) {
                System.out.print(op[i]);
            }
        }
        System.out.print("=7");
    }
}
