#include<bits/stdc++.h>
using namespace std;
int n;
int val[6];
long double x[25],y[25];
int ls[25],rs[25],typ[25];
int mi[25];
int idcnt=1;
mt19937 ra(time(0));
long double f(long double x,long double y,int typ){
	if(typ==0) return x+y;
	else if(typ==1) return x-y;
	else if(typ==2) return x*y;
	else if(typ==3){
		if(abs(y-0)<=1e-5) return ra();
		return x/y;
	}
	else if(typ==4) return sin(x);
	else return cos(x);
}
void prt(int p){
	printf("(");
	if(p==-1) printf("x");
	else if(typ[p]==0){
		prt(ls[p]);printf("+");prt(rs[p]);
	}
	else if(typ[p]==1){
		prt(ls[p]);printf("-");prt(rs[p]);
	}
	else if(typ[p]==2){
		prt(ls[p]);printf("*");prt(rs[p]);
	}
	else if(typ[p]==3){
		prt(ls[p]);printf("/");prt(rs[p]);
	}
	else if(typ[p]==4){
		printf("sin(");prt(ls[p]);printf(")");
	}
	else if(typ[p]==5){
		printf("cos(");prt(ls[p]);printf(")");
	}
	printf(")");
}
long double calc(int p,long double x){
	long double lc=x,rc=x;
	if(ls[p]!=-1) lc=calc(ls[p],x);
	if(rs[p]!=-1) rc=calc(rs[p],x);
	return f(lc,rc,typ[p]);
}
void check(){
	for(int i=1;i<=n;i++) if(abs(calc(1,x[i])-y[i])/max((long double)1,abs(y[i]))>1e-3) return;
	prt(1);
	exit(0);
}
void dfs(int lim,vector<int>vec){
	int tmp[25];
	check();
	int cnt=0;
	for(int i=0;i<vec.size();i++) cnt+=val[typ[vec[i]]];
	for(int i=1;i<=cnt;i++) tmp[i]=-1;
	vector<int>nxt;
	int befcnt=idcnt;
	for(int i=1;i<mi[cnt];i++){
		for(int j=1;j<=cnt;j++){
			tmp[j]++;
			if(tmp[j]==6) tmp[j]=-1;
			else break;
		}
		int nxtcnt=0;
		for(int i=1;i<=cnt;i++) if(tmp[i]!=-1) nxtcnt+=val[tmp[i]];
		if(nxtcnt>lim) continue;
		int poi=cnt;
		for(int j=0;j<vec.size();j++){
			if(typ[vec[j]]<=3){
				if(tmp[poi]!=-1){
					ls[vec[j]]=++idcnt;
					typ[idcnt]=tmp[poi--];
					nxt.push_back(idcnt);
				}
				else{
					ls[vec[j]]=-1;
					poi--;
				}
				if(tmp[poi]!=-1){
					rs[vec[j]]=++idcnt;
					typ[idcnt]=tmp[poi--];
					nxt.push_back(idcnt);
				}
				else{
					rs[vec[j]]=-1;
					poi--;
				}
			}
			else{
				if(tmp[poi]!=-1){
					ls[vec[j]]=++idcnt;
					typ[idcnt]=tmp[poi--];
					nxt.push_back(idcnt);
				}
				else{
					ls[vec[j]]=-1;
					poi--;
				}
				rs[vec[j]]=-1;
			}
		}
		dfs(lim-nxtcnt,nxt);
		nxt.clear();
		idcnt=befcnt;
	}
	for(int i=0;i<vec.size();i++) ls[vec[i]]=rs[vec[i]]=-1;
}
int main(){
	mi[0]=1;
	for(int i=1;i<=9;i++) mi[i]=mi[i-1]*7;
	val[0]=val[1]=val[2]=val[3]=2;
	val[4]=val[5]=1;
	for(int i=1;i<=20;i++) ls[i]=-1,rs[i]=-1;
	cin>>n;
	for(int i=1;i<=n;i++) scanf("%Lf%Lf",&x[i],&y[i]);
	vector<int>vec;
	vec.push_back(1);
	for(int i=0;i<6;i++){
		typ[1]=i;
		ls[1]=-1,rs[1]=-1;
		dfs(9-val[i],vec);
	}
	puts("-1");
	return 0;
}