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");
    }
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz