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

#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template<typename T>void chkmax(T&x,const T&y){if(x<y)x=y;}
template<typename T>void chkmin(T&x,const T&y){if(y<x)x=y;}

#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define mem(x) memset((x),0,sizeof(x))

typedef double db;
typedef long long ll;
typedef vector<int>vi;
typedef pair<int,int>pii;

typedef unsigned u32;
typedef unsigned uint;
typedef unsigned long long u64;

namespace orzjk{
  const int SZ=1e6;
  char buf[SZ],*p1=buf,*p2=buf;
  char nc(){
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,SZ,stdin),p1==p2)?EOF:*p1++;
  }
  char fub[SZ],*p3=fub,*p4=fub+SZ;
  void pc(char c){
    p3==p4&&(fwrite(fub,1,SZ,stdout),p3=fub);
    *p3++=c;
  }
  void flush(){
    fwrite(fub,1,p3-fub,stdout),p3=fub;
  }
}
using orzjk::nc;
using orzjk::pc;

//#define nc getchar
//#define pc putchar

int read(){
  int x=0,f=1;char c=nc();
  while(c<48)c=='-'&&(f=-1),c=nc();
  while(c>47)x=x*10+(c^48),c=nc();
  return x*f;
}
template<class T>void write(T x){
  static char st[41];
  if(!x)return pc(48),void();
  char*p=st;
  if(x<0)x=-x,pc('-');
  for(;x;x/=10)*p++=x%10|48;
  do{
    pc(*--p);
  }while(p!=st);
}

//const int P=1e9+7;
const int P=998244353;
int qp(int a,int k){
  int res=1;for(;k;k>>=1,a=1ll*a*a%P)if(k&1)res=1ll*res*a%P;return res;
}

struct node{
  string str;array<db,20>val;
};
vector<node>buk[10];

void solve(){
  int m;
  cin>>m;
  array<db,20>x,y;
  rep(i,0,m-1)cin>>x[i]>>y[i];
  
  buk[0].pb({"x",x});
  rep(_,1,9){
    array<db,20>c;
    for(auto[s,a]:buk[_-1]){
      rep(i,0,m-1)c[i]=sin(a[i]);
      buk[_].pb({"sin("+s+")",c});
      rep(i,0,m-1)c[i]=cos(a[i]);
      buk[_].pb({"cos("+s+")",c});
    }
    rep(l,0,_-2){
      int r=_-2-l;
      for(auto[s,a]:buk[l])for(auto[t,b]:buk[r]){
        rep(i,0,m-1)c[i]=a[i]+b[i];
        buk[_].pb({"("+s+"+"+t+")",c});
        rep(i,0,m-1)c[i]=a[i]-b[i];
        buk[_].pb({"("+s+"-"+t+")",c});
        rep(i,0,m-1)c[i]=a[i]*b[i];
        buk[_].pb({"("+s+"*"+t+")",c});
        bool flg=1;
        rep(i,0,m-1)c[i]=a[i]/b[i],flg&=fabs(b[i])>0.01;
        if(flg)
        buk[_].pb({"("+s+"/"+t+")",c});
      }
    }
  }
  
  rep(_,0,9){
    for(auto[s,f]:buk[_]){
      bool flg=1;
      rep(i,0,m-1)flg&=fabs(f[i]-y[i])/max(1.0,fabs(y[i]))<1e-3;
      if(flg){
        cout<<s<<endl;
        exit(0);
      }
    }
  }
}

signed main(){
//  freopen(".in","r",stdin);
//  freopen(".out","w",stdout);
//  int T;cin>>T;while(T--)solve();
  solve();
  orzjk::flush();
  return 0;
}