#include<bits/stdc++.h>
using namespace std;

#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()

using ll = long long;
using ld = long double;

string ops[] = {"+", "*", "/", "-"};
string un[] = {"sin", "cos"};
const int N = 10;
vector<string>s[N];
const ld inf = 1e18;
const ld eps = 1e-6;

bool equal(ld x, ld y){
	return fabs(x - y) < eps;
}

bool ok;

ld Cos(ld x){
	return cos(x);
}

ld Sin(ld x){
	return sin(x);
}

ld Div(ld x, ld y){
	if(abs(y) <= 1e-4){
		ok = false;
		return inf;
	}
	return x / y;
}

ld Plu(ld x, ld y){
	return x + y;
}

ld Min(ld x, ld y){
	return x - y;
}

ld Mul(ld x, ld y){
	return x * y;
}

function<ld(ld)> Un[] = {Sin, Cos};
function<ld(ld, ld)> Ops[] = {Plu, Mul, Div, Min};
vector<ld> rem[N];
vector<vector<int>>Go[N];
void gen(int diff){
	vector<vector<int>>go;
	int Mid = sz(Go[diff - 1]);
	for(int s_ = 0; s_ < Mid; s_++)
		for(int u = 0; u < 2; u++)
			go.push_back({diff - 1, s_, -1, u});
	if(diff >= 2){
		for(int l = 0; l <= diff - 2; l++){
			int r = diff - 2 - l;
			if(r > l)
				continue;
			int L = sz(Go[l]);
			int R = sz(Go[r]);
			for(int l_ = 0; l_ < L; l_++)
				for(int r_ = 0; r_ < R; r_++){
					for(int u = 0; u < 4; u++){
						go.push_back({l, l_, r_, u});
					}
					for(int u = 2; u < 4; u++){
						go.push_back({r, r_, l_, u});
					}
				}
		}
	}
	Go[diff] = go;
	return;
}

ld x[20], y[20];

ld getvl(int diff, int ind, ld curX){
	if(diff == 0)
		return curX;
	vector<int> g = Go[diff][ind]; 

	int l = g[0];
	if(l == diff - 1)
		return Un[g[3]](getvl(l, g[1], curX));
	int r = diff - 2 - l;
	return Ops[g[3]](getvl(l, g[1], curX), getvl(r, g[2], curX));
}

string genStr(int diff, int ind){
	if(diff == 0)
		return "x";
	vector<int> g = Go[diff][ind]; 
	int l = g[0];
	if(l == diff - 1)
		return un[g[3]] + "(" + genStr(l, g[1]) + ")";
	int r = diff - 2 - l;
	return "(" + genStr(l, g[1]) + ")" + ops[g[3]] + "(" + genStr(r, g[2]) + ")";
}


void solve(){
	int n;
	cin >> n;
	for(int i = 0 ; i < n; i++){
		cin >> x[i] >> y[i];
	}
	Go[0] = vector<vector<int>>(1, vector<int>());
	for(int i = 1; i < N; i++)
		gen(i);
	for(int Sz = 0; Sz < N; Sz++){
		for(int seq = 0; seq < Go[Sz].size(); seq++){
			bool eq = true;
			for(int i = 0; i < n; i++){
				ok = true;
				ld res = getvl(Sz, seq, x[i]);
				if(!ok || !equal(res, y[i])){
					eq = false;
					break;
				}
			}
			if(eq){
				cout << genStr(Sz, seq);
				return;
			}
		}
	}
}

int main() {
	cin.tie(nullptr) -> sync_with_stdio(false);
	solve();
	return 0;
}