import java.util.Scanner;

public class Main {
    static String a[];
    static String n;
    static String ans;

  public static void main(String[] args) {
	  Scanner sc = new Scanner(System.in);
	  n = sc.next();
	  a = new String[n.length()];
	  for(int i = 0; i < n.length(); i++) {
		  a[i] = n.substring(i, i+1);
	  }
	  if(dfs(0,a[0],Integer.parseInt(a[0]))){
		  System.out.println(ans+"=7");
	  }
      sc.close();
  }
  static public Boolean dfs(int i,String sum,int sum2) {
	//基本ケース　枝の最後の基本ケース
    if (i == n.length()-1) {
    		if (sum2 == 7) {
    			ans = sum;
    			return true;
    		}
    		return false;
    }

    //再帰ケース
    if(dfs(i + 1,sum + "+" + a[i+1],sum2 + Integer.parseInt(a[i+1]))) return true;
    if(dfs(i + 1,sum + "-" + a[i+1],sum2 - Integer.parseInt(a[i+1]))) return true;

    return false;
  }
} import java.util.Scanner; Scanner java.util public class Main {
    static String a[];
    static String n;
    static String ans;

  public static void main(String[] args) {
	  Scanner sc = new Scanner(System.in);
	  n = sc.next();
	  a = new String[n.length()];
	  for(int i = 0; i < n.length(); i++) {
		  a[i] = n.substring(i, i+1);
	  }
	  if(dfs(0,a[0],Integer.parseInt(a[0]))){
		  System.out.println(ans+"=7");
	  }
      sc.close();
  }
  static public Boolean dfs(int i,String sum,int sum2) {
	//基本ケース　枝の最後の基本ケース
    if (i == n.length()-1) {
    		if (sum2 == 7) {
    			ans = sum;
    			return true;
    		}
    		return false;
    }

    //再帰ケース
    if(dfs(i + 1,sum + "+" + a[i+1],sum2 + Integer.parseInt(a[i+1]))) return true;
    if(dfs(i + 1,sum + "-" + a[i+1],sum2 - Integer.parseInt(a[i+1]))) return true;

    return false;
  }
} Main static String a[]; a static String n; n static String ans; ans public static void main(String[] args) {
	  Scanner sc = new Scanner(System.in);
	  n = sc.next();
	  a = new String[n.length()];
	  for(int i = 0; i < n.length(); i++) {
		  a[i] = n.substring(i, i+1);
	  }
	  if(dfs(0,a[0],Integer.parseInt(a[0]))){
		  System.out.println(ans+"=7");
	  }
      sc.close();
  } main {
	  Scanner sc = new Scanner(System.in);
	  n = sc.next();
	  a = new String[n.length()];
	  for(int i = 0; i < n.length(); i++) {
		  a[i] = n.substring(i, i+1);
	  }
	  if(dfs(0,a[0],Integer.parseInt(a[0]))){
		  System.out.println(ans+"=7");
	  }
      sc.close();
  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) n = sc.next() n sc.next() sc.next sc a = new String[n.length()] a new String[n.length()] n.length() n.length n for(int i = 0; i < n.length(); i++) {
		  a[i] = n.substring(i, i+1);
	  } int i = 0; int i = 0; i 0 i < n.length() i n.length() n.length n i++ i++ i {
		  a[i] = n.substring(i, i+1);
	  } {
		  a[i] = n.substring(i, i+1);
	  } a[i] = n.substring(i, i+1) a[i] a i n.substring(i, i+1) n.substring n i i+1 i 1 if(dfs(0,a[0],Integer.parseInt(a[0]))){
		  System.out.println(ans+"=7");
	  } dfs(0,a[0],Integer.parseInt(a[0])) dfs 0 a[0] a 0 Integer.parseInt(a[0]) Integer.parseInt Integer a[0] a 0 {
		  System.out.println(ans+"=7");
	  } System.out.println(ans+"=7") System.out.println System.out System System.out ans+"=7" ans "=7" sc.close() sc.close sc String[] args args static public Boolean dfs(int i,String sum,int sum2) {
	//基本ケース　枝の最後の基本ケース
    if (i == n.length()-1) {
    		if (sum2 == 7) {
    			ans = sum;
    			return true;
    		}
    		return false;
    }

    //再帰ケース
    if(dfs(i + 1,sum + "+" + a[i+1],sum2 + Integer.parseInt(a[i+1]))) return true;
    if(dfs(i + 1,sum + "-" + a[i+1],sum2 - Integer.parseInt(a[i+1]))) return true;

    return false;
  } dfs {
	//基本ケース　枝の最後の基本ケース
    if (i == n.length()-1) {
    		if (sum2 == 7) {
    			ans = sum;
    			return true;
    		}
    		return false;
    }

    //再帰ケース
    if(dfs(i + 1,sum + "+" + a[i+1],sum2 + Integer.parseInt(a[i+1]))) return true;
    if(dfs(i + 1,sum + "-" + a[i+1],sum2 - Integer.parseInt(a[i+1]))) return true;

    return false;
  } if (i == n.length()-1) {
    		if (sum2 == 7) {
    			ans = sum;
    			return true;
    		}
    		return false;
    } i == n.length()-1 i n.length()-1 n.length() n.length n 1 {
    		if (sum2 == 7) {
    			ans = sum;
    			return true;
    		}
    		return false;
    } if (sum2 == 7) {
    			ans = sum;
    			return true;
    		} sum2 == 7 sum2 7 {
    			ans = sum;
    			return true;
    		} ans = sum ans sum return true; true return false; false if(dfs(i + 1,sum + "+" + a[i+1],sum2 + Integer.parseInt(a[i+1]))) return true; dfs(i + 1,sum + "+" + a[i+1],sum2 + Integer.parseInt(a[i+1])) dfs i + 1 i 1 sum + "+" + a[i+1] sum + "+" + a[i+1] sum "+" a[i+1] a i+1 i 1 sum2 + Integer.parseInt(a[i+1]) sum2 Integer.parseInt(a[i+1]) Integer.parseInt Integer a[i+1] a i+1 i 1 return true; true if(dfs(i + 1,sum + "-" + a[i+1],sum2 - Integer.parseInt(a[i+1]))) return true; dfs(i + 1,sum + "-" + a[i+1],sum2 - Integer.parseInt(a[i+1])) dfs i + 1 i 1 sum + "-" + a[i+1] sum + "-" + a[i+1] sum "-" a[i+1] a i+1 i 1 sum2 - Integer.parseInt(a[i+1]) sum2 Integer.parseInt(a[i+1]) Integer.parseInt Integer a[i+1] a i+1 i 1 return true; true return false; false int i i String sum sum int sum2 sum2 public class Main {
    static String a[];
    static String n;
    static String ans;

  public static void main(String[] args) {
	  Scanner sc = new Scanner(System.in);
	  n = sc.next();
	  a = new String[n.length()];
	  for(int i = 0; i < n.length(); i++) {
		  a[i] = n.substring(i, i+1);
	  }
	  if(dfs(0,a[0],Integer.parseInt(a[0]))){
		  System.out.println(ans+"=7");
	  }
      sc.close();
  }
  static public Boolean dfs(int i,String sum,int sum2) {
	//基本ケース　枝の最後の基本ケース
    if (i == n.length()-1) {
    		if (sum2 == 7) {
    			ans = sum;
    			return true;
    		}
    		return false;
    }

    //再帰ケース
    if(dfs(i + 1,sum + "+" + a[i+1],sum2 + Integer.parseInt(a[i+1]))) return true;
    if(dfs(i + 1,sum + "-" + a[i+1],sum2 - Integer.parseInt(a[i+1]))) return true;

    return false;
  }
} public class Main {
    static String a[];
    static String n;
    static String ans;

  public static void main(String[] args) {
	  Scanner sc = new Scanner(System.in);
	  n = sc.next();
	  a = new String[n.length()];
	  for(int i = 0; i < n.length(); i++) {
		  a[i] = n.substring(i, i+1);
	  }
	  if(dfs(0,a[0],Integer.parseInt(a[0]))){
		  System.out.println(ans+"=7");
	  }
      sc.close();
  }
  static public Boolean dfs(int i,String sum,int sum2) {
	//基本ケース　枝の最後の基本ケース
    if (i == n.length()-1) {
    		if (sum2 == 7) {
    			ans = sum;
    			return true;
    		}
    		return false;
    }

    //再帰ケース
    if(dfs(i + 1,sum + "+" + a[i+1],sum2 + Integer.parseInt(a[i+1]))) return true;
    if(dfs(i + 1,sum + "-" + a[i+1],sum2 - Integer.parseInt(a[i+1]))) return true;

    return false;
  }
} Main
import java.util.Scanner;

public class Main {
    static String a[];
    static String n;
    static String ans;

  public static void main(String[] args) {
	  Scanner sc = new Scanner(System.in);
	  n = sc.next();
	  a = new String[n.length()];
	  for(int i = 0; i < n.length(); i++) {
		  a[i] = n.substring(i, i+1);
	  }
	  if(dfs(0,a[0],Integer.parseInt(a[0]))){
		  System.out.println(ans+"=7");
	  }
      sc.close();
  }
  static public Boolean dfs(int i,String sum,int sum2) {
	//基本ケース　枝の最後の基本ケース
    if (i == n.length()-1) {
    		if (sum2 == 7) {
    			ans = sum;
    			return true;
    		}
    		return false;
    }

    //再帰ケース
    if(dfs(i + 1,sum + "+" + a[i+1],sum2 + Integer.parseInt(a[i+1]))) return true;
    if(dfs(i + 1,sum + "-" + a[i+1],sum2 - Integer.parseInt(a[i+1]))) return true;

    return false;
  }
}