#include <bits/stdc++.h>

using namespace std;

//ax^flag
struct node {
	int a = 0;
	bool flag;
};
vector<node> fun;
char the_x;

//done
//处理单项�� 
//flag == true, 在等号左边，否则在等号右��
void mk(string str, bool flag) {
	bool flag999 = false;
	int p = 0;
	node nd;
	if(str[p] == '+' || str[p] == '-') p++;
	if(p == 1 && str[p - 1] == '-') flag999 = true;
	while(str[p] >= '0' && str[p] <= '9' && p < str.length()) {
		nd.a *= 10;
		nd.a += str[p] - '0';
		p++;
	}
	if(p == str.length()) nd.flag = false;
	else {
		if(str[p] >= 'a' && str[p] <= 'z') the_x = str[p], nd.flag = true;
	}
	if(!flag) nd.a *= -1;
	if(flag999) nd.a *= -1;
	fun.push_back(nd);
//	printf("get new nd->a = %d, flag = %d\n", nd.a, nd.flag);
}

//done
char first_str() {
	char next;
	string str;
	str.push_back(getchar());
	while(true) {
		char ch = getchar();
		if(ch == '+' || ch == '-' || ch == '=') {
			next = ch;
			break;
		}
		str.push_back(ch);
	}
//	cout << str << endl;
	mk(str, true);
	return next;
}

pair<char, string> get_next() {
	char next;
	string str;
	while(true) {
		char ch = getchar();
		if(ch == '+' || ch == '-' || ch == '=' || ch == '\n' || ch == 'EOF' || ch == '\0') {
			next = ch;
			break;
		}
		str.push_back(ch);
	}
//	cout << str << endl;
	return {next, str};
}

bool cmp(node a, node b) {
	if(a.flag == b.flag) return true;
	if(a.flag == true) return true;
	return false;
}

int main() {
	bool flag233 = true;//等号左右�� 
	char ch = first_str();
	if(ch == '=') flag233 = false;
//	cout << "next->" << ch << endl;
	while(true){
		pair<char, string> ret = get_next();
		if(ch == '-') ret.second = "-" + ret.second;
		ch = ret.first;
//		cout << "ret.first->" << ret.first << " ret.second->" << ret.second << endl;
		mk(ret.second, flag233);
		if(ch == '\n' || ch == 'EOF' || ch == '\0') break;
		if(ch == '=') flag233 = false;
	}
//	sort(fun.begin(), fun.end(), cmp);
//	for(int i = 0; i < fun.size(); i++) {
//		if(fun[i].a >= 0) printf("+%dx^%d", fun[i].a, fun[i].flag);
//		else if(fun[i].a < 0) printf("%dx^%d", fun[i].a, fun[i].flag);
//	}
//	cout << endl;
	double nd1, nd0;
	for(int i = 0; i < fun.size(); i++) {
		if(fun[i].flag) {
			nd1 += fun[i].a;
		}
		else nd0 += fun[i].a;
	}
	
//	cout << "nd0->" << nd0 << " nd1->" << nd1 << endl;
	
	nd0 = -nd0;
	double ans = nd0 / nd1;
	if(abs(ans) > 0.001) printf("%c=%.3lf\n", the_x, ans);
	else printf("%c=0.000\n", the_x);
	
	return 0;
}