import java.io.*;
import java.math.*;
import java.util.*;
public class Main { 
 
	public static void main(String[] args) { 
		FastScanner I = new FastScanner(); //Input
		OutPut O = new OutPut(); //Output
		ArrayList<Character> ticket = new ArrayList<Character>();
		String S = I.next();
		for (int i = 0; i<4; i++) ticket.add(S.charAt(i));
		for (int mask = 0; mask < (1<<3); mask++){ //1<<x creates x empty slots through 
		//a binary string representation
			char[] seq = new char[3]; //Sequence if +/-
			for (int chk = 0; chk < 3; chk++) {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			}
			int cur = S.charAt(0)-'0';
			for (int chk = 0; chk<3; chk++) {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			}
			if (cur==7) {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			}
		}
	}
	public static ArrayList<String> perms(int N,int limit){
		if (N==1) {
			ArrayList<String> ret = new ArrayList<String>();
			for (int i = 0; i < limit; i++) {
				 ret.add(Integer.toString(i));
			}
			return ret;
		}
		ArrayList<String> prev = perms(N-1,limit);
		ArrayList<String> ret = new ArrayList<String>();
		for (int i = 0; i < prev.size(); i++) {
			String cur = prev.get(i);
			boolean[] vis = new boolean[10];
			for (int j = 0; j < cur.length(); j++) {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			}
			if (!vis[1]) {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			}else ret.add(cur); //Just use previous end on 1 sequence	
		}
		return ret;
	}
	public static long ceil(long num, long den) {long ans = num/den; if (num%den!=0) 
	ans++; return ans;}
	public static long GCD(long a, long b) {
		if (a==0||b==0) return Math.max(a,b);
		return GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b));
	}
	public static long FastExp(long base, long exp, long mod) {
		long ans=1;
		while (exp>0) {
			if (exp%2==1) ans*=base;
			exp/=2;
			base*=base;
			base%=mod;
			ans%=mod;
		}
		return ans;
	}
	public static long ModInv(long num,long mod) {return FastExp(num,mod-2,mod);}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		int nextInt() {return Integer.parseInt(next());}
		long nextLong() {return Long.parseLong(next());};
	}
	static class OutPut{
		PrintWriter w = new PrintWriter(System.out);
		void pln(double x) {w.println(x);w.flush();}
		void pln(int x) {w.println(x);w.flush();}
		void pln(long x) {w.println(x);w.flush();}
		void pln(String x) {w.println(x);w.flush();}
		void pln(char x) {w.println(x);w.flush();}
		void pln(StringBuilder x) {w.println(x);w.flush();}
		void p(int x) {w.print(x);w.flush();}
		void p(long x) {w.print(x);w.flush();}
		void p(String x) {w.print(x);w.flush();}
		void p(char x) {w.print(x);w.flush();}
		void p(StringBuilder x) {w.print(x);w.flush();}
	}
} import java.io.*; io.* java import java.math.*; math.* java import java.util.*; util.* java public class Main { 
 
	public static void main(String[] args) { 
		FastScanner I = new FastScanner(); //Input
		OutPut O = new OutPut(); //Output
		ArrayList<Character> ticket = new ArrayList<Character>();
		String S = I.next();
		for (int i = 0; i<4; i++) ticket.add(S.charAt(i));
		for (int mask = 0; mask < (1<<3); mask++){ //1<<x creates x empty slots through 
		//a binary string representation
			char[] seq = new char[3]; //Sequence if +/-
			for (int chk = 0; chk < 3; chk++) {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			}
			int cur = S.charAt(0)-'0';
			for (int chk = 0; chk<3; chk++) {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			}
			if (cur==7) {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			}
		}
	}
	public static ArrayList<String> perms(int N,int limit){
		if (N==1) {
			ArrayList<String> ret = new ArrayList<String>();
			for (int i = 0; i < limit; i++) {
				 ret.add(Integer.toString(i));
			}
			return ret;
		}
		ArrayList<String> prev = perms(N-1,limit);
		ArrayList<String> ret = new ArrayList<String>();
		for (int i = 0; i < prev.size(); i++) {
			String cur = prev.get(i);
			boolean[] vis = new boolean[10];
			for (int j = 0; j < cur.length(); j++) {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			}
			if (!vis[1]) {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			}else ret.add(cur); //Just use previous end on 1 sequence	
		}
		return ret;
	}
	public static long ceil(long num, long den) {long ans = num/den; if (num%den!=0) 
	ans++; return ans;}
	public static long GCD(long a, long b) {
		if (a==0||b==0) return Math.max(a,b);
		return GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b));
	}
	public static long FastExp(long base, long exp, long mod) {
		long ans=1;
		while (exp>0) {
			if (exp%2==1) ans*=base;
			exp/=2;
			base*=base;
			base%=mod;
			ans%=mod;
		}
		return ans;
	}
	public static long ModInv(long num,long mod) {return FastExp(num,mod-2,mod);}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		int nextInt() {return Integer.parseInt(next());}
		long nextLong() {return Long.parseLong(next());};
	}
	static class OutPut{
		PrintWriter w = new PrintWriter(System.out);
		void pln(double x) {w.println(x);w.flush();}
		void pln(int x) {w.println(x);w.flush();}
		void pln(long x) {w.println(x);w.flush();}
		void pln(String x) {w.println(x);w.flush();}
		void pln(char x) {w.println(x);w.flush();}
		void pln(StringBuilder x) {w.println(x);w.flush();}
		void p(int x) {w.print(x);w.flush();}
		void p(long x) {w.print(x);w.flush();}
		void p(String x) {w.print(x);w.flush();}
		void p(char x) {w.print(x);w.flush();}
		void p(StringBuilder x) {w.print(x);w.flush();}
	}
} Main public static void main(String[] args) { 
		FastScanner I = new FastScanner(); //Input
		OutPut O = new OutPut(); //Output
		ArrayList<Character> ticket = new ArrayList<Character>();
		String S = I.next();
		for (int i = 0; i<4; i++) ticket.add(S.charAt(i));
		for (int mask = 0; mask < (1<<3); mask++){ //1<<x creates x empty slots through 
		//a binary string representation
			char[] seq = new char[3]; //Sequence if +/-
			for (int chk = 0; chk < 3; chk++) {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			}
			int cur = S.charAt(0)-'0';
			for (int chk = 0; chk<3; chk++) {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			}
			if (cur==7) {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			}
		}
	} main { 
		FastScanner I = new FastScanner(); //Input
		OutPut O = new OutPut(); //Output
		ArrayList<Character> ticket = new ArrayList<Character>();
		String S = I.next();
		for (int i = 0; i<4; i++) ticket.add(S.charAt(i));
		for (int mask = 0; mask < (1<<3); mask++){ //1<<x creates x empty slots through 
		//a binary string representation
			char[] seq = new char[3]; //Sequence if +/-
			for (int chk = 0; chk < 3; chk++) {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			}
			int cur = S.charAt(0)-'0';
			for (int chk = 0; chk<3; chk++) {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			}
			if (cur==7) {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			}
		}
	} FastScanner I = new FastScanner(); I new FastScanner() OutPut O = new OutPut(); O new OutPut() ArrayList<Character> ticket = new ArrayList<Character>(); ticket new ArrayList<Character>() String S = I.next(); S I.next() I.next I for (int i = 0; i<4; i++) ticket.add(S.charAt(i)); int i = 0; int i = 0; i 0 i<4 i 4 i++ i++ i ticket.add(S.charAt(i)); ticket.add(S.charAt(i)) ticket.add ticket S.charAt(i) S.charAt S i for (int mask = 0; mask < (1<<3); mask++){ //1<<x creates x empty slots through 
		//a binary string representation
			char[] seq = new char[3]; //Sequence if +/-
			for (int chk = 0; chk < 3; chk++) {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			}
			int cur = S.charAt(0)-'0';
			for (int chk = 0; chk<3; chk++) {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			}
			if (cur==7) {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			}
		} int mask = 0; int mask = 0; mask 0 mask < (1<<3) mask (1<<3) 1 3 mask++ mask++ mask { //1<<x creates x empty slots through 
		//a binary string representation
			char[] seq = new char[3]; //Sequence if +/-
			for (int chk = 0; chk < 3; chk++) {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			}
			int cur = S.charAt(0)-'0';
			for (int chk = 0; chk<3; chk++) {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			}
			if (cur==7) {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			}
		} { //1<<x creates x empty slots through 
		//a binary string representation
			char[] seq = new char[3]; //Sequence if +/-
			for (int chk = 0; chk < 3; chk++) {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			}
			int cur = S.charAt(0)-'0';
			for (int chk = 0; chk<3; chk++) {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			}
			if (cur==7) {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			}
		} char[] seq = new char[3]; seq new char[3] 3 for (int chk = 0; chk < 3; chk++) {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			} int chk = 0; int chk = 0; chk 0 chk < 3 chk 3 chk++ chk++ chk {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			} {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			} if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-'; (mask>>chk)%2==1 (mask>>chk)%2 (mask>>chk) mask chk 2 1 seq[3-chk-1]='+' seq[3-chk-1] seq 3-chk-1 3-chk-1 3 chk 1 '+' seq[3-chk-1]='-' seq[3-chk-1] seq 3-chk-1 3-chk-1 3 chk 1 '-' int cur = S.charAt(0)-'0'; cur S.charAt(0)-'0' S.charAt(0) S.charAt S 0 '0' for (int chk = 0; chk<3; chk++) {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			} int chk = 0; int chk = 0; chk 0 chk<3 chk 3 chk++ chk++ chk {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			} {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			} int next = S.charAt(chk+1)-'0'; next S.charAt(chk+1)-'0' S.charAt(chk+1) S.charAt S chk+1 chk 1 '0' if (seq[chk]=='+') cur+=next;
				else cur-=next; seq[chk]=='+' seq[chk] seq chk '+' cur+=next cur next cur-=next cur next if (cur==7) {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			} cur==7 cur 7 {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			} StringBuilder ans = new StringBuilder(); ans new StringBuilder() ans.append(S.charAt(0)) ans.append ans S.charAt(0) S.charAt S 0 for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				} int i = 0; int i = 0; i 0 i < 3 i 3 i++ i++ i {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				} {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				} ans.append(seq[i]) ans.append ans seq[i] seq i ans.append(S.charAt(i+1)) ans.append ans S.charAt(i+1) S.charAt S i+1 i 1 String end = "=7"; end "=7" ans.append(end) ans.append ans end O.pln(ans) O.pln O ans break; String[] args args public static ArrayList<String> perms(int N,int limit){
		if (N==1) {
			ArrayList<String> ret = new ArrayList<String>();
			for (int i = 0; i < limit; i++) {
				 ret.add(Integer.toString(i));
			}
			return ret;
		}
		ArrayList<String> prev = perms(N-1,limit);
		ArrayList<String> ret = new ArrayList<String>();
		for (int i = 0; i < prev.size(); i++) {
			String cur = prev.get(i);
			boolean[] vis = new boolean[10];
			for (int j = 0; j < cur.length(); j++) {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			}
			if (!vis[1]) {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			}else ret.add(cur); //Just use previous end on 1 sequence	
		}
		return ret;
	} perms {
		if (N==1) {
			ArrayList<String> ret = new ArrayList<String>();
			for (int i = 0; i < limit; i++) {
				 ret.add(Integer.toString(i));
			}
			return ret;
		}
		ArrayList<String> prev = perms(N-1,limit);
		ArrayList<String> ret = new ArrayList<String>();
		for (int i = 0; i < prev.size(); i++) {
			String cur = prev.get(i);
			boolean[] vis = new boolean[10];
			for (int j = 0; j < cur.length(); j++) {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			}
			if (!vis[1]) {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			}else ret.add(cur); //Just use previous end on 1 sequence	
		}
		return ret;
	} if (N==1) {
			ArrayList<String> ret = new ArrayList<String>();
			for (int i = 0; i < limit; i++) {
				 ret.add(Integer.toString(i));
			}
			return ret;
		} N==1 N 1 {
			ArrayList<String> ret = new ArrayList<String>();
			for (int i = 0; i < limit; i++) {
				 ret.add(Integer.toString(i));
			}
			return ret;
		} ArrayList<String> ret = new ArrayList<String>(); ret new ArrayList<String>() for (int i = 0; i < limit; i++) {
				 ret.add(Integer.toString(i));
			} int i = 0; int i = 0; i 0 i < limit i limit i++ i++ i {
				 ret.add(Integer.toString(i));
			} {
				 ret.add(Integer.toString(i));
			} ret.add(Integer.toString(i)) ret.add ret Integer.toString(i) Integer.toString Integer i return ret; ret ArrayList<String> prev = perms(N-1,limit); prev perms(N-1,limit) perms N-1 N 1 limit ArrayList<String> ret = new ArrayList<String>(); ret new ArrayList<String>() for (int i = 0; i < prev.size(); i++) {
			String cur = prev.get(i);
			boolean[] vis = new boolean[10];
			for (int j = 0; j < cur.length(); j++) {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			}
			if (!vis[1]) {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			}else ret.add(cur); //Just use previous end on 1 sequence	
		} int i = 0; int i = 0; i 0 i < prev.size() i prev.size() prev.size prev i++ i++ i {
			String cur = prev.get(i);
			boolean[] vis = new boolean[10];
			for (int j = 0; j < cur.length(); j++) {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			}
			if (!vis[1]) {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			}else ret.add(cur); //Just use previous end on 1 sequence	
		} {
			String cur = prev.get(i);
			boolean[] vis = new boolean[10];
			for (int j = 0; j < cur.length(); j++) {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			}
			if (!vis[1]) {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			}else ret.add(cur); //Just use previous end on 1 sequence	
		} String cur = prev.get(i); cur prev.get(i) prev.get prev i boolean[] vis = new boolean[10]; vis new boolean[10] 10 for (int j = 0; j < cur.length(); j++) {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			} int j = 0; int j = 0; j 0 j < cur.length() j cur.length() cur.length cur j++ j++ j {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			} {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			} int dig = Integer.parseInt(cur.substring(j,j+1)); dig Integer.parseInt(cur.substring(j,j+1)) Integer.parseInt Integer cur.substring(j,j+1) cur.substring cur j j+1 j 1 vis[dig]=true vis[dig] vis dig true if (!vis[1]) {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			}else ret.add(cur); //Just use previous end on 1 sequence	 !vis[1] vis[1] vis 1 {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			} for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				} int next = 0; int next = 0; next 0 next < limit next limit next++ next++ next {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				} {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				} if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					} !vis[next] vis[next] vis next {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					} String add = cur; add cur add+=Integer.toString(next) add Integer.toString(next) Integer.toString Integer next ret.add(add) ret.add ret add ret.add(cur) ret.add ret cur return ret; ret int N N int limit limit public static long ceil(long num, long den) {long ans = num/den; if (num%den!=0) 
	ans++; return ans;} ceil {long ans = num/den; if (num%den!=0) 
	ans++; return ans;} long ans = num/den; ans num/den num den if (num%den!=0) 
	ans++; num%den!=0 num%den num den 0 ans++ ans return ans; ans long num num long den den public static long GCD(long a, long b) {
		if (a==0||b==0) return Math.max(a,b);
		return GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b));
	} GCD {
		if (a==0||b==0) return Math.max(a,b);
		return GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b));
	} if (a==0||b==0) return Math.max(a,b); a==0||b==0 a==0 a 0 b==0 b 0 return Math.max(a,b); Math.max(a,b) Math.max Math a b return GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b)); GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b)) GCD Math.min(a, b) Math.min Math a b Math.max(a, b)%Math.min(a, b) Math.max(a, b) Math.max Math a b Math.min(a, b) Math.min Math a b long a a long b b public static long FastExp(long base, long exp, long mod) {
		long ans=1;
		while (exp>0) {
			if (exp%2==1) ans*=base;
			exp/=2;
			base*=base;
			base%=mod;
			ans%=mod;
		}
		return ans;
	} FastExp {
		long ans=1;
		while (exp>0) {
			if (exp%2==1) ans*=base;
			exp/=2;
			base*=base;
			base%=mod;
			ans%=mod;
		}
		return ans;
	} long ans=1; ans 1 while (exp>0) {
			if (exp%2==1) ans*=base;
			exp/=2;
			base*=base;
			base%=mod;
			ans%=mod;
		} exp>0 exp 0 {
			if (exp%2==1) ans*=base;
			exp/=2;
			base*=base;
			base%=mod;
			ans%=mod;
		} if (exp%2==1) ans*=base; exp%2==1 exp%2 exp 2 1 ans*=base ans base exp/=2 exp 2 base*=base base base base%=mod base mod ans%=mod ans mod return ans; ans long base base long exp exp long mod mod public static long ModInv(long num,long mod) {return FastExp(num,mod-2,mod);} ModInv {return FastExp(num,mod-2,mod);} return FastExp(num,mod-2,mod); FastExp(num,mod-2,mod) FastExp num mod-2 mod 2 mod long num num long mod mod static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		int nextInt() {return Integer.parseInt(next());}
		long nextLong() {return Long.parseLong(next());};
	} FastScanner BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); br new BufferedReader(new InputStreamReader(System.in)) StringTokenizer st=new StringTokenizer(""); st new StringTokenizer("") String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		} next {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		} while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				} !st.hasMoreTokens() st.hasMoreTokens() st.hasMoreTokens st try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				} catch (IOException e) {
					e.printStackTrace();
				} IOException e {
					e.printStackTrace();
				} e.printStackTrace() e.printStackTrace e {
					st=new StringTokenizer(br.readLine());
				} st=new StringTokenizer(br.readLine()) st new StringTokenizer(br.readLine()) return st.nextToken(); st.nextToken() st.nextToken st int nextInt() {return Integer.parseInt(next());} nextInt {return Integer.parseInt(next());} return Integer.parseInt(next()); Integer.parseInt(next()) Integer.parseInt Integer next() next long nextLong() {return Long.parseLong(next());} nextLong {return Long.parseLong(next());} return Long.parseLong(next()); Long.parseLong(next()) Long.parseLong Long next() next static class OutPut{
		PrintWriter w = new PrintWriter(System.out);
		void pln(double x) {w.println(x);w.flush();}
		void pln(int x) {w.println(x);w.flush();}
		void pln(long x) {w.println(x);w.flush();}
		void pln(String x) {w.println(x);w.flush();}
		void pln(char x) {w.println(x);w.flush();}
		void pln(StringBuilder x) {w.println(x);w.flush();}
		void p(int x) {w.print(x);w.flush();}
		void p(long x) {w.print(x);w.flush();}
		void p(String x) {w.print(x);w.flush();}
		void p(char x) {w.print(x);w.flush();}
		void p(StringBuilder x) {w.print(x);w.flush();}
	} OutPut PrintWriter w = new PrintWriter(System.out); w new PrintWriter(System.out) void pln(double x) {w.println(x);w.flush();} pln {w.println(x);w.flush();} w.println(x) w.println w x w.flush() w.flush w double x x void pln(int x) {w.println(x);w.flush();} pln {w.println(x);w.flush();} w.println(x) w.println w x w.flush() w.flush w int x x void pln(long x) {w.println(x);w.flush();} pln {w.println(x);w.flush();} w.println(x) w.println w x w.flush() w.flush w long x x void pln(String x) {w.println(x);w.flush();} pln {w.println(x);w.flush();} w.println(x) w.println w x w.flush() w.flush w String x x void pln(char x) {w.println(x);w.flush();} pln {w.println(x);w.flush();} w.println(x) w.println w x w.flush() w.flush w char x x void pln(StringBuilder x) {w.println(x);w.flush();} pln {w.println(x);w.flush();} w.println(x) w.println w x w.flush() w.flush w StringBuilder x x void p(int x) {w.print(x);w.flush();} p {w.print(x);w.flush();} w.print(x) w.print w x w.flush() w.flush w int x x void p(long x) {w.print(x);w.flush();} p {w.print(x);w.flush();} w.print(x) w.print w x w.flush() w.flush w long x x void p(String x) {w.print(x);w.flush();} p {w.print(x);w.flush();} w.print(x) w.print w x w.flush() w.flush w String x x void p(char x) {w.print(x);w.flush();} p {w.print(x);w.flush();} w.print(x) w.print w x w.flush() w.flush w char x x void p(StringBuilder x) {w.print(x);w.flush();} p {w.print(x);w.flush();} w.print(x) w.print w x w.flush() w.flush w StringBuilder x x public class Main { 
 
	public static void main(String[] args) { 
		FastScanner I = new FastScanner(); //Input
		OutPut O = new OutPut(); //Output
		ArrayList<Character> ticket = new ArrayList<Character>();
		String S = I.next();
		for (int i = 0; i<4; i++) ticket.add(S.charAt(i));
		for (int mask = 0; mask < (1<<3); mask++){ //1<<x creates x empty slots through 
		//a binary string representation
			char[] seq = new char[3]; //Sequence if +/-
			for (int chk = 0; chk < 3; chk++) {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			}
			int cur = S.charAt(0)-'0';
			for (int chk = 0; chk<3; chk++) {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			}
			if (cur==7) {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			}
		}
	}
	public static ArrayList<String> perms(int N,int limit){
		if (N==1) {
			ArrayList<String> ret = new ArrayList<String>();
			for (int i = 0; i < limit; i++) {
				 ret.add(Integer.toString(i));
			}
			return ret;
		}
		ArrayList<String> prev = perms(N-1,limit);
		ArrayList<String> ret = new ArrayList<String>();
		for (int i = 0; i < prev.size(); i++) {
			String cur = prev.get(i);
			boolean[] vis = new boolean[10];
			for (int j = 0; j < cur.length(); j++) {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			}
			if (!vis[1]) {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			}else ret.add(cur); //Just use previous end on 1 sequence	
		}
		return ret;
	}
	public static long ceil(long num, long den) {long ans = num/den; if (num%den!=0) 
	ans++; return ans;}
	public static long GCD(long a, long b) {
		if (a==0||b==0) return Math.max(a,b);
		return GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b));
	}
	public static long FastExp(long base, long exp, long mod) {
		long ans=1;
		while (exp>0) {
			if (exp%2==1) ans*=base;
			exp/=2;
			base*=base;
			base%=mod;
			ans%=mod;
		}
		return ans;
	}
	public static long ModInv(long num,long mod) {return FastExp(num,mod-2,mod);}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		int nextInt() {return Integer.parseInt(next());}
		long nextLong() {return Long.parseLong(next());};
	}
	static class OutPut{
		PrintWriter w = new PrintWriter(System.out);
		void pln(double x) {w.println(x);w.flush();}
		void pln(int x) {w.println(x);w.flush();}
		void pln(long x) {w.println(x);w.flush();}
		void pln(String x) {w.println(x);w.flush();}
		void pln(char x) {w.println(x);w.flush();}
		void pln(StringBuilder x) {w.println(x);w.flush();}
		void p(int x) {w.print(x);w.flush();}
		void p(long x) {w.print(x);w.flush();}
		void p(String x) {w.print(x);w.flush();}
		void p(char x) {w.print(x);w.flush();}
		void p(StringBuilder x) {w.print(x);w.flush();}
	}
} public class Main { 
 
	public static void main(String[] args) { 
		FastScanner I = new FastScanner(); //Input
		OutPut O = new OutPut(); //Output
		ArrayList<Character> ticket = new ArrayList<Character>();
		String S = I.next();
		for (int i = 0; i<4; i++) ticket.add(S.charAt(i));
		for (int mask = 0; mask < (1<<3); mask++){ //1<<x creates x empty slots through 
		//a binary string representation
			char[] seq = new char[3]; //Sequence if +/-
			for (int chk = 0; chk < 3; chk++) {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			}
			int cur = S.charAt(0)-'0';
			for (int chk = 0; chk<3; chk++) {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			}
			if (cur==7) {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			}
		}
	}
	public static ArrayList<String> perms(int N,int limit){
		if (N==1) {
			ArrayList<String> ret = new ArrayList<String>();
			for (int i = 0; i < limit; i++) {
				 ret.add(Integer.toString(i));
			}
			return ret;
		}
		ArrayList<String> prev = perms(N-1,limit);
		ArrayList<String> ret = new ArrayList<String>();
		for (int i = 0; i < prev.size(); i++) {
			String cur = prev.get(i);
			boolean[] vis = new boolean[10];
			for (int j = 0; j < cur.length(); j++) {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			}
			if (!vis[1]) {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			}else ret.add(cur); //Just use previous end on 1 sequence	
		}
		return ret;
	}
	public static long ceil(long num, long den) {long ans = num/den; if (num%den!=0) 
	ans++; return ans;}
	public static long GCD(long a, long b) {
		if (a==0||b==0) return Math.max(a,b);
		return GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b));
	}
	public static long FastExp(long base, long exp, long mod) {
		long ans=1;
		while (exp>0) {
			if (exp%2==1) ans*=base;
			exp/=2;
			base*=base;
			base%=mod;
			ans%=mod;
		}
		return ans;
	}
	public static long ModInv(long num,long mod) {return FastExp(num,mod-2,mod);}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		int nextInt() {return Integer.parseInt(next());}
		long nextLong() {return Long.parseLong(next());};
	}
	static class OutPut{
		PrintWriter w = new PrintWriter(System.out);
		void pln(double x) {w.println(x);w.flush();}
		void pln(int x) {w.println(x);w.flush();}
		void pln(long x) {w.println(x);w.flush();}
		void pln(String x) {w.println(x);w.flush();}
		void pln(char x) {w.println(x);w.flush();}
		void pln(StringBuilder x) {w.println(x);w.flush();}
		void p(int x) {w.print(x);w.flush();}
		void p(long x) {w.print(x);w.flush();}
		void p(String x) {w.print(x);w.flush();}
		void p(char x) {w.print(x);w.flush();}
		void p(StringBuilder x) {w.print(x);w.flush();}
	}
} Main
import java.io.*;
import java.math.*;
import java.util.*;
public class Main { 
 
	public static void main(String[] args) { 
		FastScanner I = new FastScanner(); //Input
		OutPut O = new OutPut(); //Output
		ArrayList<Character> ticket = new ArrayList<Character>();
		String S = I.next();
		for (int i = 0; i<4; i++) ticket.add(S.charAt(i));
		for (int mask = 0; mask < (1<<3); mask++){ //1<<x creates x empty slots through 
		//a binary string representation
			char[] seq = new char[3]; //Sequence if +/-
			for (int chk = 0; chk < 3; chk++) {
				if ((mask>>chk)%2==1) seq[3-chk-1]='+';
				else seq[3-chk-1]='-';
			}
			int cur = S.charAt(0)-'0';
			for (int chk = 0; chk<3; chk++) {
				int next = S.charAt(chk+1)-'0'; //Next digit of ticket
				if (seq[chk]=='+') cur+=next;
				else cur-=next;
			}
			if (cur==7) {
				StringBuilder ans = new StringBuilder();
				ans.append(S.charAt(0));
				for (int i = 0; i < 3; i++) {
					ans.append(seq[i]);
					ans.append(S.charAt(i+1));
				}
				String end = "=7";
				ans.append(end);
				O.pln(ans);
				break;
			}
		}
	}
	public static ArrayList<String> perms(int N,int limit){
		if (N==1) {
			ArrayList<String> ret = new ArrayList<String>();
			for (int i = 0; i < limit; i++) {
				 ret.add(Integer.toString(i));
			}
			return ret;
		}
		ArrayList<String> prev = perms(N-1,limit);
		ArrayList<String> ret = new ArrayList<String>();
		for (int i = 0; i < prev.size(); i++) {
			String cur = prev.get(i);
			boolean[] vis = new boolean[10];
			for (int j = 0; j < cur.length(); j++) {
				int dig = Integer.parseInt(cur.substring(j,j+1));
				vis[dig]=true;
			}
			if (!vis[1]) {
				for (int next = 0; next < limit; next++) {
					if (!vis[next]) {
						String add = cur;
						add+=Integer.toString(next);
						ret.add(add);
					}
				}
			}else ret.add(cur); //Just use previous end on 1 sequence	
		}
		return ret;
	}
	public static long ceil(long num, long den) {long ans = num/den; if (num%den!=0) 
	ans++; return ans;}
	public static long GCD(long a, long b) {
		if (a==0||b==0) return Math.max(a,b);
		return GCD(Math.min(a, b),Math.max(a, b)%Math.min(a, b));
	}
	public static long FastExp(long base, long exp, long mod) {
		long ans=1;
		while (exp>0) {
			if (exp%2==1) ans*=base;
			exp/=2;
			base*=base;
			base%=mod;
			ans%=mod;
		}
		return ans;
	}
	public static long ModInv(long num,long mod) {return FastExp(num,mod-2,mod);}
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		int nextInt() {return Integer.parseInt(next());}
		long nextLong() {return Long.parseLong(next());};
	}
	static class OutPut{
		PrintWriter w = new PrintWriter(System.out);
		void pln(double x) {w.println(x);w.flush();}
		void pln(int x) {w.println(x);w.flush();}
		void pln(long x) {w.println(x);w.flush();}
		void pln(String x) {w.println(x);w.flush();}
		void pln(char x) {w.println(x);w.flush();}
		void pln(StringBuilder x) {w.println(x);w.flush();}
		void p(int x) {w.print(x);w.flush();}
		void p(long x) {w.print(x);w.flush();}
		void p(String x) {w.print(x);w.flush();}
		void p(char x) {w.print(x);w.flush();}
		void p(StringBuilder x) {w.print(x);w.flush();}
	}
}
