#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long double ld;
typedef long long ll;

const ld EPS = 0.005;
const ld EPS_RES = 1e-4;

struct Node
{
 	int opcode;
 	int son[2];
};

ld valx[25], valy[25];
ld result[25][1005];

vector <vector <Node> > generate_expr(int deep, int state)
{
	if (state == 0)
	{
	 	return generate_expr(deep, 1);
 	}
 	if (state == 1)
 	{
 		vector <vector <Node> > A = generate_expr(deep, 2);

 		for (int lef = 0; lef <= deep - 2; lef++)
 		{
 			int rig = deep - 2 - lef;

 			vector <vector <Node> > B = generate_expr(lef, 0);
 			vector <vector <Node> > C = generate_expr(rig, 0);
 			for (const auto &x : B)
 				for (const auto &y : C)
 				{
 				 	vector <Node> D = x;
 				 	for (const auto &z : y) D.pb(z);
 				 	
 				 	Node new_node;
 				 	new_node.opcode = 2;
 				 	new_node.son[0] = (int) y.size() + 1;
 				 	new_node.son[1] = 1;
 				 	D.pb(new_node);

 				 	vector <Node> E = x;
 				 	for (const auto &z : y) E.pb(z);
 				 	
 				 	new_node.opcode = 3;
 				 	new_node.son[0] = (int) y.size() + 1;
 				 	new_node.son[1] = 1;
 				 	E.pb(new_node);

 				 	A.pb(D), A.pb(E);
 				}
 		}
 		return A;
 	}
 	if (state == 2)
 	{
 		vector <vector <Node> > A = generate_expr(deep, 3);

 		for (int lef = 0; lef <= deep - 2; lef++)
 		{
 			int rig = deep - 2 - lef;

 			{
    			vector <vector <Node> > B = generate_expr(lef, 0);
    			vector <vector <Node> > C = generate_expr(rig, 0);
    			for (const auto &x : B)
    				for (const auto &y : C)
    				{
    				 	vector <Node> D = x;
    				 	for (const auto &z : y) D.pb(z);
    				 	
    				 	Node new_node;
    				 	new_node.opcode = 4;
    				 	new_node.son[0] = (int) y.size() + 1;
    				 	new_node.son[1] = 1;
    				 	D.pb(new_node);

    				 	vector <Node> E = x;
    				 	for (const auto &z : y) E.pb(z);
    				 	
    				 	new_node.opcode = 5;
    				 	new_node.son[0] = (int) y.size() + 1;
    				 	new_node.son[1] = 1;
    				 	E.pb(new_node);

    				 	A.pb(D), A.pb(E);
    				}
    		}
 		}
 		return A;
 	}
 	if (state == 3)
 	{
 		if (deep == 0)
 		{
 		 	Node new_node;
 		 	new_node.opcode = 6;
 		 	return {{new_node}};
 		}

 		vector <vector <Node> > A = generate_expr(deep - 1, 0);

 		vector <vector <Node> > res;
 		for (const auto &x : A)
 		{
 			vector <Node> B = x, C = x;
 		
 			Node new_node;
 			new_node.opcode = 0;
 			new_node.son[0] = 1;
 			B.pb(new_node);

 			new_node.opcode = 1;
 			new_node.son[0] = 1;
 			C.pb(new_node);

 			res.pb(B), res.pb(C);
 		}
 		return res;
 	}
 	return {};
}

string recover_answer(vector <Node> tree)
{
 	Node last = tree.back();
 	string ans;
 	if (last.opcode == 0)
 	{
 		string L = recover_answer(vector <Node>(tree.begin(), tree.begin() + (int) tree.size() - 1));
 		ans = "sin(" + L + ")";
 	}
 	if (last.opcode == 1)
 	{
 		string L = recover_answer(vector <Node>(tree.begin(), tree.begin() + (int) tree.size() - 1));
 		ans = "cos(" + L + ")";
 	}
 	if (last.opcode == 2)
 	{
 		int lef = last.son[0];

 		string L = recover_answer(vector <Node>(tree.begin(), tree.begin() + (int) tree.size() - lef));
 		string R = recover_answer(vector <Node>(tree.begin() + (int) tree.size() - lef, tree.begin() + (int) tree.size() - 1));
 		ans = "(" + L + ")+(" + R + ")";
 	}
 	if (last.opcode == 3)
 	{
 		int lef = last.son[0];

 		string L = recover_answer(vector <Node>(tree.begin(), tree.begin() + (int) tree.size() - lef));
 		string R = recover_answer(vector <Node>(tree.begin() + (int) tree.size() - lef, tree.begin() + (int) tree.size() - 1));
 		ans = "(" + L + ")-(" + R + ")";
 	}
 	if (last.opcode == 4)
 	{
 		int lef = last.son[0];

 		string L = recover_answer(vector <Node>(tree.begin(), tree.begin() + (int) tree.size() - lef));
 		string R = recover_answer(vector <Node>(tree.begin() + (int) tree.size() - lef, tree.begin() + (int) tree.size() - 1));
 		ans = "(" + L + ")/(" + R + ")";
 	}
 	if (last.opcode == 5)
 	{
 		int lef = last.son[0];

 		string L = recover_answer(vector <Node>(tree.begin(), tree.begin() + (int) tree.size() - lef));
 		string R = recover_answer(vector <Node>(tree.begin() + (int) tree.size() - lef, tree.begin() + (int) tree.size() - 1));
 		ans = "(" + L + ")*(" + R + ")";
 	}
 	if (last.opcode == 6)
 	{
 		ans = "x";
 	}
 	return ans;
}

int main()
{
 	//freopen("input.txt", "r", stdin);
 	//freopen("output.txt", "w", stdout);
	ios_base::sync_with_stdio(0); cin.tie(0);

	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> valx[i] >> valy[i];

	vector <vector <Node> > all_var;
	for (int i = 0; i <= 9; i++)
	{
	 	vector <vector <Node> > res = generate_expr(i, 0);
	 	for (const auto &x : res) all_var.pb(x);
	}

	for (const auto &tree : all_var)
	{
	 	bool FLAG = true;
	 	for (int num = 0; num < (int) tree.size(); num++)
	 	{
	 	 	const Node &node = tree[num];
	 	 	if (node.opcode == 0)
	 	 	{
	 	 	 	int pr = num - node.son[0];
	 	 	 	for (int i = 1; i <= n; i++) result[i][num] = sin(result[i][pr]);
	 	 	}
	 	 	if (node.opcode == 1)
	 	 	{
	 	 		int pr = num - node.son[0];
	 	 	 	for (int i = 1; i <= n; i++) result[i][num] = cos(result[i][pr]);
	 	 	}
	 	 	if (node.opcode == 2)
	 	 	{
	 	 		int lef = num - node.son[0];
	 	 		int rig = num - node.son[1];
	 	 		for (int i = 1; i <= n; i++) result[i][num] = result[i][lef] + result[i][rig];
	 	 	}
	 	 	if (node.opcode == 3)
	 	 	{
	 	 		int lef = num - node.son[0];
	 	 		int rig = num - node.son[1];
	 	 		for (int i = 1; i <= n; i++) result[i][num] = result[i][lef] - result[i][rig];
	 	 	}
	 	 	if (node.opcode == 4)
	 	 	{
	 	 		int lef = num - node.son[0];
	 	 		int rig = num - node.son[1];
	 	 		for (int i = 1; i <= n; i++)
	 	 		{
	 	 			if (fabs(result[i][rig]) < EPS) {FLAG = false; continue;}
	 	 			result[i][num] = result[i][lef] / result[i][rig];
	 	 		}
	 	 	}
	 	 	if (node.opcode == 5)
	 	 	{
	 	 		int lef = num - node.son[0];
	 	 		int rig = num - node.son[1];
	 	 		for (int i = 1; i <= n; i++) result[i][num] = result[i][lef] * result[i][rig];
	 	 	}
	 	 	if (node.opcode == 6)
	 	 	{
	 	 	 	for (int i = 1; i <= n; i++) result[i][num] = valx[i];
	 	 	}
	 	}
	 	//cout << recover_answer(tree) << '\n';
	 	if (!FLAG) continue;

	 	bool ANS = true;
	 	for (int i = 1; i <= n; i++)
	 		if (fabs(valy[i] - result[i][(int) tree.size() - 1]) > EPS_RES) ANS = false;
	 	if (!ANS) continue;

	 	string ans = recover_answer(tree);
	 	cout << ans << '\n';
	 	exit(0);
	}
	return 0;
}