#include<bits/stdc++.h>
#define ll   long long
#define pb   emplace_back
#define mp   make_pair
#define orz  1000000007
#define fi   first
#define se   second
#pragma GCC optmize("O2")
#define ld   __float128
using namespace std;
int n;
ld x[22],y[22],Y[22],s[22][15];
char S[33];
ld ab(ld x){return (x<0?-x:x);}
string _s[33];
pair<string,ld> ANS[33];
int res;
void prt(int n){
	int k=0;
	for(int i=1;i<=n;++i){
		if(S[i]=='x')_s[++k]="x";
		else if(S[i]=='+'||S[i]=='-'||S[i]=='*'||S[i]=='/'){
			_s[k-1]='('+_s[k-1]+')'+S[i]+'('+_s[k]+')';
			--k;
		}
		else if(S[i]=='s'){
			_s[k]="sin("+_s[k]+')';
		}
		else{
			_s[k]="cos("+_s[k]+')';
		}
	}
	ANS[++res].fi=_s[1];
}
void sol(int c,int ls,int lS){
	if(ls==1){
		bool ok=1;
		for(int i=1;i<=n;++i){
			if(ab(s[i][1]-y[i])*Y[i]>0.0005){
				ok=0;
				break;
			}
		}
		if(ok){
			prt(lS);
			ANS[res].se=0;
			for(int i=1;i<=n;++i)ANS[res].se=max(ANS[res].se,ab(s[i][1]-y[i])*Y[i]);
			if(res>=30){
				int k=1;
				for(int i=2;i<=res;++i)if(ANS[i].se<ANS[k].se)k=i;
				for(int i=0;i<ANS[k].fi.size();++i)printf("%c",ANS[k].fi[i]);
				printf("\n");
				exit(0);
			}
		}
	}
	if(ls*2+c<=9){//x
		S[lS+1]='x';
		for(int i=1;i<=n;++i)s[i][ls+1]=x[i];
		sol(c,ls+1,lS+1);
	}
	if(ls>=2){//+-*/
		{//+
			S[lS+1]='+';
			pair<ld,ld> d[22];
			for(int i=1;i<=n;++i)d[i]=mp(s[i][ls-1],s[i][ls]),s[i][ls-1]=s[i][ls-1]+s[i][ls];
			sol(c+2,ls-1,lS+1);
			for(int i=1;i<=n;++i)s[i][ls-1]=d[i].fi,s[i][ls]=d[i].se;
		}
		{//-
			S[lS+1]='-';
			pair<ld,ld> d[22];
			for(int i=1;i<=n;++i)d[i]=mp(s[i][ls-1],s[i][ls]),s[i][ls-1]=s[i][ls-1]-s[i][ls];
			sol(c+2,ls-1,lS+1);
			for(int i=1;i<=n;++i)s[i][ls-1]=d[i].fi,s[i][ls]=d[i].se;
		}
		{//*
			S[lS+1]='*';
			pair<ld,ld> d[22];
			for(int i=1;i<=n;++i)d[i]=mp(s[i][ls-1],s[i][ls]),s[i][ls-1]=s[i][ls-1]*s[i][ls];
			sol(c+2,ls-1,lS+1);
			for(int i=1;i<=n;++i)s[i][ls-1]=d[i].fi,s[i][ls]=d[i].se;
		}
		{///
			S[lS+1]='/';
			bool ok=1;
			for(int i=1;i<=n;++i)if(ab(s[i][ls])<0.16)ok=0,i=n;
			if(ok){
				pair<ld,ld> d[22];
				for(int i=1;i<=n;++i)d[i]=mp(s[i][ls-1],s[i][ls]),s[i][ls-1]=s[i][ls-1]/s[i][ls];
				sol(c+2,ls-1,lS+1);
				for(int i=1;i<=n;++i)s[i][ls-1]=d[i].fi,s[i][ls]=d[i].se;
			}
		}
	}
	if(ls>=1&&c+(ls-1)*2+1<=9){//sc
		{
			//s
			S[lS+1]='s';
			ld d[22];
			for(int i=1;i<=n;++i)d[i]=s[i][ls],s[i][ls]=sin((double)s[i][ls]);
			sol(c+1,ls,lS+1);
			for(int i=1;i<=n;++i)s[i][ls]=d[i];
		}
		{
			//c
			S[lS+1]='c';
			ld d[22];
			for(int i=1;i<=n;++i)d[i]=s[i][ls],s[i][ls]=cos((double)s[i][ls]);
			sol(c+1,ls,lS+1);
			for(int i=1;i<=n;++i)s[i][ls]=d[i];
		}
	}
}	
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		double _x,_y;
		scanf("%lf%lf",&_x,&_y);
		x[i]=_x,y[i]=_y;
		Y[i]=(ld)1.0/max((ld)1.0,ab(y[i]));
	}
	sol(0,0,0);
	int k=1;
	for(int i=2;i<=res;++i)if(ANS[i].se<ANS[k].se)k=i;
	for(int i=0;i<ANS[k].fi.size();++i)printf("%c",ANS[k].fi[i]);
	printf("\n");
    return 0;
}