import java.util.Scanner;

public class Main {

	/** 7 */
	private static final int SEVEN = 7;

	public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			char[] abcd = scanner.next().toCharArray();
			for (int i = 0; i < (1 << abcd.length); i++) {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			}
		}
	}

	/**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てて、結果が7かどうかを判定
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return 結果が7かどうか
	 */
	private static boolean ok(char[] abcd, int n) {
		int result = abcd[0] - '0';
		for (int i = 1; i < abcd.length; i++) {
			if (1 == (n & 1)) {
				result += abcd[i] - '0';
			} else {
				result -= abcd[i] - '0';
			}
			n >>= 1;
		}
		return SEVEN == result;
	}

	/**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てる
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return a?b?c?d の数式
	 */
	private static String toFormula(char[] abcd, int n) {
		StringBuilder result = new StringBuilder();
		for (char c : abcd) {
			result.append(c);
			result.append((1 == (n & 1)) ? '+' : '-');
			n >>= 1;
		}
		// 最後の文字を削除
		result.deleteCharAt(result.length() - 1);
		return result.toString();
	}
} import java.util.Scanner; Scanner java.util public class Main {

	/** 7 */
	private static final int SEVEN = 7;

	public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			char[] abcd = scanner.next().toCharArray();
			for (int i = 0; i < (1 << abcd.length); i++) {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			}
		}
	}

	/**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てて、結果が7かどうかを判定
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return 結果が7かどうか
	 */
	private static boolean ok(char[] abcd, int n) {
		int result = abcd[0] - '0';
		for (int i = 1; i < abcd.length; i++) {
			if (1 == (n & 1)) {
				result += abcd[i] - '0';
			} else {
				result -= abcd[i] - '0';
			}
			n >>= 1;
		}
		return SEVEN == result;
	}

	/**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てる
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return a?b?c?d の数式
	 */
	private static String toFormula(char[] abcd, int n) {
		StringBuilder result = new StringBuilder();
		for (char c : abcd) {
			result.append(c);
			result.append((1 == (n & 1)) ? '+' : '-');
			n >>= 1;
		}
		// 最後の文字を削除
		result.deleteCharAt(result.length() - 1);
		return result.toString();
	}
} Main /** 7 */
	private static final int SEVEN = 7; SEVEN 7 public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			char[] abcd = scanner.next().toCharArray();
			for (int i = 0; i < (1 << abcd.length); i++) {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			}
		}
	} main {
		try (Scanner scanner = new Scanner(System.in)) {
			char[] abcd = scanner.next().toCharArray();
			for (int i = 0; i < (1 << abcd.length); i++) {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			}
		}
	} try (Scanner scanner = new Scanner(System.in)) {
			char[] abcd = scanner.next().toCharArray();
			for (int i = 0; i < (1 << abcd.length); i++) {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			}
		} {
			char[] abcd = scanner.next().toCharArray();
			for (int i = 0; i < (1 << abcd.length); i++) {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			}
		} Scanner scanner = new Scanner(System.in) Scanner scanner = new Scanner(System.in) new Scanner(System.in) char[] abcd = scanner.next().toCharArray(); abcd scanner.next().toCharArray() scanner.next().toCharArray scanner.next() scanner.next scanner for (int i = 0; i < (1 << abcd.length); i++) {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			} int i = 0; int i = 0; i 0 i < (1 << abcd.length) i (1 << abcd.length) 1 abcd.length abcd abcd.length i++ i++ i {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			} {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			} if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				} ok(abcd, i) ok abcd i {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				} System.out.println(toFormula(abcd, i) + "=" + SEVEN) System.out.println System.out System System.out toFormula(abcd, i) + "=" + SEVEN toFormula(abcd, i) + "=" + SEVEN toFormula(abcd, i) toFormula abcd i "=" SEVEN return; String[] args args /**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てて、結果が7かどうかを判定
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return 結果が7かどうか
	 */
	private static boolean ok(char[] abcd, int n) {
		int result = abcd[0] - '0';
		for (int i = 1; i < abcd.length; i++) {
			if (1 == (n & 1)) {
				result += abcd[i] - '0';
			} else {
				result -= abcd[i] - '0';
			}
			n >>= 1;
		}
		return SEVEN == result;
	} ok {
		int result = abcd[0] - '0';
		for (int i = 1; i < abcd.length; i++) {
			if (1 == (n & 1)) {
				result += abcd[i] - '0';
			} else {
				result -= abcd[i] - '0';
			}
			n >>= 1;
		}
		return SEVEN == result;
	} int result = abcd[0] - '0'; result abcd[0] - '0' abcd[0] abcd 0 '0' for (int i = 1; i < abcd.length; i++) {
			if (1 == (n & 1)) {
				result += abcd[i] - '0';
			} else {
				result -= abcd[i] - '0';
			}
			n >>= 1;
		} int i = 1; int i = 1; i 1 i < abcd.length i abcd.length abcd abcd.length i++ i++ i {
			if (1 == (n & 1)) {
				result += abcd[i] - '0';
			} else {
				result -= abcd[i] - '0';
			}
			n >>= 1;
		} {
			if (1 == (n & 1)) {
				result += abcd[i] - '0';
			} else {
				result -= abcd[i] - '0';
			}
			n >>= 1;
		} if (1 == (n & 1)) {
				result += abcd[i] - '0';
			} else {
				result -= abcd[i] - '0';
			} 1 == (n & 1) 1 (n & 1) n 1 {
				result += abcd[i] - '0';
			} result += abcd[i] - '0' result abcd[i] - '0' abcd[i] abcd i '0' {
				result -= abcd[i] - '0';
			} result -= abcd[i] - '0' result abcd[i] - '0' abcd[i] abcd i '0' n >>= 1 n 1 return SEVEN == result; SEVEN == result SEVEN result char[] abcd abcd int n n /**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てる
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return a?b?c?d の数式
	 */
	private static String toFormula(char[] abcd, int n) {
		StringBuilder result = new StringBuilder();
		for (char c : abcd) {
			result.append(c);
			result.append((1 == (n & 1)) ? '+' : '-');
			n >>= 1;
		}
		// 最後の文字を削除
		result.deleteCharAt(result.length() - 1);
		return result.toString();
	} toFormula {
		StringBuilder result = new StringBuilder();
		for (char c : abcd) {
			result.append(c);
			result.append((1 == (n & 1)) ? '+' : '-');
			n >>= 1;
		}
		// 最後の文字を削除
		result.deleteCharAt(result.length() - 1);
		return result.toString();
	} StringBuilder result = new StringBuilder(); result new StringBuilder() for (char c : abcd) {
			result.append(c);
			result.append((1 == (n & 1)) ? '+' : '-');
			n >>= 1;
		} char c abcd {
			result.append(c);
			result.append((1 == (n & 1)) ? '+' : '-');
			n >>= 1;
		} {
			result.append(c);
			result.append((1 == (n & 1)) ? '+' : '-');
			n >>= 1;
		} result.append(c) result.append result c result.append((1 == (n & 1)) ? '+' : '-') result.append result (1 == (n & 1)) ? '+' : '-' (1 == (n & 1)) 1 (n & 1) n 1 '+' '-' n >>= 1 n 1 result.deleteCharAt(result.length() - 1) result.deleteCharAt result result.length() - 1 result.length() result.length result 1 return result.toString(); result.toString() result.toString result char[] abcd abcd int n n public class Main {

	/** 7 */
	private static final int SEVEN = 7;

	public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			char[] abcd = scanner.next().toCharArray();
			for (int i = 0; i < (1 << abcd.length); i++) {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			}
		}
	}

	/**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てて、結果が7かどうかを判定
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return 結果が7かどうか
	 */
	private static boolean ok(char[] abcd, int n) {
		int result = abcd[0] - '0';
		for (int i = 1; i < abcd.length; i++) {
			if (1 == (n & 1)) {
				result += abcd[i] - '0';
			} else {
				result -= abcd[i] - '0';
			}
			n >>= 1;
		}
		return SEVEN == result;
	}

	/**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てる
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return a?b?c?d の数式
	 */
	private static String toFormula(char[] abcd, int n) {
		StringBuilder result = new StringBuilder();
		for (char c : abcd) {
			result.append(c);
			result.append((1 == (n & 1)) ? '+' : '-');
			n >>= 1;
		}
		// 最後の文字を削除
		result.deleteCharAt(result.length() - 1);
		return result.toString();
	}
} public class Main {

	/** 7 */
	private static final int SEVEN = 7;

	public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			char[] abcd = scanner.next().toCharArray();
			for (int i = 0; i < (1 << abcd.length); i++) {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			}
		}
	}

	/**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てて、結果が7かどうかを判定
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return 結果が7かどうか
	 */
	private static boolean ok(char[] abcd, int n) {
		int result = abcd[0] - '0';
		for (int i = 1; i < abcd.length; i++) {
			if (1 == (n & 1)) {
				result += abcd[i] - '0';
			} else {
				result -= abcd[i] - '0';
			}
			n >>= 1;
		}
		return SEVEN == result;
	}

	/**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てる
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return a?b?c?d の数式
	 */
	private static String toFormula(char[] abcd, int n) {
		StringBuilder result = new StringBuilder();
		for (char c : abcd) {
			result.append(c);
			result.append((1 == (n & 1)) ? '+' : '-');
			n >>= 1;
		}
		// 最後の文字を削除
		result.deleteCharAt(result.length() - 1);
		return result.toString();
	}
} Main
import java.util.Scanner;

public class Main {

	/** 7 */
	private static final int SEVEN = 7;

	public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			char[] abcd = scanner.next().toCharArray();
			for (int i = 0; i < (1 << abcd.length); i++) {
				if (ok(abcd, i)) {
					System.out.println(toFormula(abcd, i) + "=" + SEVEN);
					return;
				}
			}
		}
	}

	/**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てて、結果が7かどうかを判定
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return 結果が7かどうか
	 */
	private static boolean ok(char[] abcd, int n) {
		int result = abcd[0] - '0';
		for (int i = 1; i < abcd.length; i++) {
			if (1 == (n & 1)) {
				result += abcd[i] - '0';
			} else {
				result -= abcd[i] - '0';
			}
			n >>= 1;
		}
		return SEVEN == result;
	}

	/**
	 * abcdと'+'か'-'を表す二進数で数式を組み立てる
	 * 
	 * @param abcd
	 * @param n    '+'か'-'を表す二進数
	 * @return a?b?c?d の数式
	 */
	private static String toFormula(char[] abcd, int n) {
		StringBuilder result = new StringBuilder();
		for (char c : abcd) {
			result.append(c);
			result.append((1 == (n & 1)) ? '+' : '-');
			n >>= 1;
		}
		// 最後の文字を削除
		result.deleteCharAt(result.length() - 1);
		return result.toString();
	}
}
