import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container;
import std.numeric, std.math;
import core.bitop;

T RD(T = string)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }

long mod = pow(10, 9) + 7;
long moda(long x, long y) { return (x + y) % mod; }
long mods(long x, long y) { return ((x + mod) - (y % mod)) % mod; }
long modm(long x, long y) { return (x * y) % mod; }

void main()
{
	auto ABCD = RD!string;
	long[4] a;
	foreach (i, c; ABCD)
	{
		a[i] = [c].to!long;
	}

	foreach (i; 0..0b1000)
	{
		auto r = a[0];
		string ans = a[0].to!string;
		foreach (j; 0..3)
		{
			if ((i & (1 << j)))
			{
				r += a[j+1];
				ans ~= "+";
			}
			else
			{
				r -= a[j+1];
				ans ~= "-";
			}
			ans ~= a[j+1].to!string;
		}
		if (r == 7)
		{
			writeln(ans ~ "=7");
			break;
		}
	}

	stdout.flush();
}