#include<bits/stdc++.h>
#define all(x) begin(x),end(x)
#define double long double
using namespace std;
enum oper{PLUS,MINUS,TIME,DIV,SIN,COS,NONE};
string name[]={"+","-","*","/","sin","cos","x"};
const int N=25;
int n;
double x[N],y[N];
double getdiff(double x,double y){
	return abs(x-y)/max<double>(1,abs(y));
}
struct func{
	oper op;
	string str;
	func *l,*r;
	pair<double,bool> calc(double x){
		if(op==NONE)return {x,false};
		if(PLUS<=op&&op<=TIME){
			auto a=l->calc(x),b=r->calc(x);
			if(a.second||b.second){return {0,true};}
			if(op==PLUS)return {a.first+b.first,false};
			if(op==MINUS)return {a.first-b.first,false};
			if(op==TIME)return {a.first*b.first,false};
		}
		if(op==DIV){
			auto a=l->calc(x),b=r->calc(x);
			if(a.second||b.second)return {0,true};
			if(abs(a.first)<=0.01)return {0,true};
			if(b.first==0||abs(b.first)<=1e-8)return {0,true};
			return {a.first/b.first,false};
		}
		if(SIN<=op&&op<=COS){
			auto a=l->calc(x);
			a.first=op==SIN?sinl(a.first):cosl(a.first);
			return a;
		}
		return {0,true};
	}
};
vector<func> f[10];
int main(){
#ifdef memset0
	freopen("B.in","r",stdin);
#endif
	cin.tie(0)->sync_with_stdio(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>x[i]>>y[i];
	}
	f[0].push_back({NONE,"x",nullptr,nullptr});
	for(int k=1;k<=9;k++){
		for(oper op=PLUS;op<=DIV;op=(oper)((int)op+1)){
			for(int i=0;i<=k;i++)
				for(int j=0;j<=k;j++)
					if(i+j+2==k){
						// if(op!=MINUS&&op!=DIV&&i>j)continue;
						for(int x=0;x<f[i].size();x++)
							for(int y=0;y<f[j].size();y++){
								f[k].push_back({
									op,
									"("+f[i][x].str+")"+name[op]+"("+f[j][y].str+")",
									&f[i][x],
									&f[j][y],
								});
							}
					}
		}
		for(oper op=SIN;op<=COS;op=(oper)((int)op+1)){
			for(int x=0;x<f[k-1].size();x++){
				f[k].push_back({
					op,
					name[op]+"("+f[k-1][x].str+")",
					&f[k-1][x],
					nullptr
				});
			}
		}
		// cerr<<k<<" >> "<<f[k].size()<<endl;
		// for(auto x:f[k])cerr<<x.str<<endl;
	}
	for(int k=0;k<=9;k++)
		for(auto fc:f[k]){
			bool ok=true;
			for(int i=1;i<=n;i++){
				auto res=fc.calc(x[i]);
				if(res.second||(getdiff(res.first,y[i])>1e-3)){
					ok=false;
					break;
				}
			}
			if(ok){
				// cerr<<"k="<<k<<endl;
				cout<<fc.str<<endl;
				return 0;
			}
		}
	assert(0);
}