import java.util.Scanner;

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

		String S = scan.next();

		int sashihiki = 0;
		int n = S.length();
		int[] Srow = new int[n];
		String[] hugou = new String[n-1];

		for (int i = 0; i < n; i++) {
			Srow[i] = Integer.parseInt(S.substring(i, i+1));
		}

		for (int bit = 0; bit < Math.pow(2, n-1); bit++) {

			sashihiki = Srow[0];

			for (int shift = 0; shift < n-1; shift++) {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			}

			if (sashihiki == 7) {
				break;
			}

		}


		if (sashihiki == 7) {

			for (int op = 0; op < n; op++) {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			}

			System.out.println("=7");

		} else {

			System.out.print("ないです");

		}

	}
} import java.util.Scanner; Scanner java.util public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);

		String S = scan.next();

		int sashihiki = 0;
		int n = S.length();
		int[] Srow = new int[n];
		String[] hugou = new String[n-1];

		for (int i = 0; i < n; i++) {
			Srow[i] = Integer.parseInt(S.substring(i, i+1));
		}

		for (int bit = 0; bit < Math.pow(2, n-1); bit++) {

			sashihiki = Srow[0];

			for (int shift = 0; shift < n-1; shift++) {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			}

			if (sashihiki == 7) {
				break;
			}

		}


		if (sashihiki == 7) {

			for (int op = 0; op < n; op++) {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			}

			System.out.println("=7");

		} else {

			System.out.print("ないです");

		}

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

		String S = scan.next();

		int sashihiki = 0;
		int n = S.length();
		int[] Srow = new int[n];
		String[] hugou = new String[n-1];

		for (int i = 0; i < n; i++) {
			Srow[i] = Integer.parseInt(S.substring(i, i+1));
		}

		for (int bit = 0; bit < Math.pow(2, n-1); bit++) {

			sashihiki = Srow[0];

			for (int shift = 0; shift < n-1; shift++) {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			}

			if (sashihiki == 7) {
				break;
			}

		}


		if (sashihiki == 7) {

			for (int op = 0; op < n; op++) {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			}

			System.out.println("=7");

		} else {

			System.out.print("ないです");

		}

	} main {
		Scanner scan = new Scanner(System.in);

		String S = scan.next();

		int sashihiki = 0;
		int n = S.length();
		int[] Srow = new int[n];
		String[] hugou = new String[n-1];

		for (int i = 0; i < n; i++) {
			Srow[i] = Integer.parseInt(S.substring(i, i+1));
		}

		for (int bit = 0; bit < Math.pow(2, n-1); bit++) {

			sashihiki = Srow[0];

			for (int shift = 0; shift < n-1; shift++) {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			}

			if (sashihiki == 7) {
				break;
			}

		}


		if (sashihiki == 7) {

			for (int op = 0; op < n; op++) {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			}

			System.out.println("=7");

		} else {

			System.out.print("ないです");

		}

	} Scanner scan = new Scanner(System.in); scan new Scanner(System.in) String S = scan.next(); S scan.next() scan.next scan int sashihiki = 0; sashihiki 0 int n = S.length(); n S.length() S.length S int[] Srow = new int[n]; Srow new int[n] n String[] hugou = new String[n-1]; hugou new String[n-1] n-1 n 1 for (int i = 0; i < n; i++) {
			Srow[i] = Integer.parseInt(S.substring(i, i+1));
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			Srow[i] = Integer.parseInt(S.substring(i, i+1));
		} {
			Srow[i] = Integer.parseInt(S.substring(i, i+1));
		} Srow[i] = Integer.parseInt(S.substring(i, i+1)) Srow[i] Srow i Integer.parseInt(S.substring(i, i+1)) Integer.parseInt Integer S.substring(i, i+1) S.substring S i i+1 i 1 for (int bit = 0; bit < Math.pow(2, n-1); bit++) {

			sashihiki = Srow[0];

			for (int shift = 0; shift < n-1; shift++) {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			}

			if (sashihiki == 7) {
				break;
			}

		} int bit = 0; int bit = 0; bit 0 bit < Math.pow(2, n-1) bit Math.pow(2, n-1) Math.pow Math 2 n-1 n 1 bit++ bit++ bit {

			sashihiki = Srow[0];

			for (int shift = 0; shift < n-1; shift++) {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			}

			if (sashihiki == 7) {
				break;
			}

		} {

			sashihiki = Srow[0];

			for (int shift = 0; shift < n-1; shift++) {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			}

			if (sashihiki == 7) {
				break;
			}

		} sashihiki = Srow[0] sashihiki Srow[0] Srow 0 for (int shift = 0; shift < n-1; shift++) {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			} int shift = 0; int shift = 0; shift 0 shift < n-1 shift n-1 n 1 shift++ shift++ shift {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			} {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			} if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				} (1&bit>>shift) == 1 (1&bit>>shift) 1 bit>>shift bit shift 1 {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} sashihiki += Srow[shift+1] sashihiki Srow[shift+1] Srow shift+1 shift 1 hugou[shift] = "+" hugou[shift] hugou shift "+" {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				} sashihiki -= Srow[shift+1] sashihiki Srow[shift+1] Srow shift+1 shift 1 hugou[shift] = "-" hugou[shift] hugou shift "-" if (sashihiki == 7) {
				break;
			} sashihiki == 7 sashihiki 7 {
				break;
			} break; if (sashihiki == 7) {

			for (int op = 0; op < n; op++) {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			}

			System.out.println("=7");

		} else {

			System.out.print("ないです");

		} sashihiki == 7 sashihiki 7 {

			for (int op = 0; op < n; op++) {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			}

			System.out.println("=7");

		} for (int op = 0; op < n; op++) {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			} int op = 0; int op = 0; op 0 op < n op n op++ op++ op {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			} {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			} System.out.print(Srow[op]) System.out.print System.out System System.out Srow[op] Srow op if (op < n-1) {
					System.out.print(hugou[op]);
				} op < n-1 op n-1 n 1 {
					System.out.print(hugou[op]);
				} System.out.print(hugou[op]) System.out.print System.out System System.out hugou[op] hugou op System.out.println("=7") System.out.println System.out System System.out "=7" {

			System.out.print("ないです");

		} System.out.print("ないです") System.out.print System.out System System.out "ないです" String[] args args public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);

		String S = scan.next();

		int sashihiki = 0;
		int n = S.length();
		int[] Srow = new int[n];
		String[] hugou = new String[n-1];

		for (int i = 0; i < n; i++) {
			Srow[i] = Integer.parseInt(S.substring(i, i+1));
		}

		for (int bit = 0; bit < Math.pow(2, n-1); bit++) {

			sashihiki = Srow[0];

			for (int shift = 0; shift < n-1; shift++) {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			}

			if (sashihiki == 7) {
				break;
			}

		}


		if (sashihiki == 7) {

			for (int op = 0; op < n; op++) {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			}

			System.out.println("=7");

		} else {

			System.out.print("ないです");

		}

	}
} public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);

		String S = scan.next();

		int sashihiki = 0;
		int n = S.length();
		int[] Srow = new int[n];
		String[] hugou = new String[n-1];

		for (int i = 0; i < n; i++) {
			Srow[i] = Integer.parseInt(S.substring(i, i+1));
		}

		for (int bit = 0; bit < Math.pow(2, n-1); bit++) {

			sashihiki = Srow[0];

			for (int shift = 0; shift < n-1; shift++) {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			}

			if (sashihiki == 7) {
				break;
			}

		}


		if (sashihiki == 7) {

			for (int op = 0; op < n; op++) {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			}

			System.out.println("=7");

		} else {

			System.out.print("ないです");

		}

	}
} Main
import java.util.Scanner;

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

		String S = scan.next();

		int sashihiki = 0;
		int n = S.length();
		int[] Srow = new int[n];
		String[] hugou = new String[n-1];

		for (int i = 0; i < n; i++) {
			Srow[i] = Integer.parseInt(S.substring(i, i+1));
		}

		for (int bit = 0; bit < Math.pow(2, n-1); bit++) {

			sashihiki = Srow[0];

			for (int shift = 0; shift < n-1; shift++) {		//全ビット探索：1が+に対応

				if ((1&bit>>shift) == 1) {
					sashihiki += Srow[shift+1];
					hugou[shift] = "+";
				} else {
					sashihiki -= Srow[shift+1];
					hugou[shift] = "-";
				}

			}

			if (sashihiki == 7) {
				break;
			}

		}


		if (sashihiki == 7) {

			for (int op = 0; op < n; op++) {
				System.out.print(Srow[op]);
				if (op < n-1) {
					System.out.print(hugou[op]);
				}
			}

			System.out.println("=7");

		} else {

			System.out.print("ないです");

		}

	}
}