#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define double long double
struct node{
    string eq;
    double ans[21];
};
vector <node> v[10];
double a[21],b[21];
int main() {
    int T = 1, kase = 0;
    //cin >> T;
    while (T--) {
        int n;
        cin>>n;
        for(int i=1;i<=n;i++) cin>>a[i]>>b[i];
        node temp;
        temp.eq="x";
        for(int i=1;i<=n;i++) temp.ans[i]=a[i];
        v[0].push_back(temp);
        int fl=1;
        for(int i=1;i<=n;i++) if(fabs(temp.ans[i]-b[i])>5e-7) fl=0;
        if(fl){
            cout<<temp.eq<<endl;
            exit(0);
        }
        for(int i=1;i<=9;i++){
            for(auto &t:v[i-1]){
                temp=t;
                temp.eq="(sin("+t.eq+"))";
                for(int j=1;j<=n;j++) temp.ans[j]=sin(temp.ans[j]);
                v[i].push_back(temp);
                temp=t;
                temp.eq="(cos("+t.eq+"))";
                for(int j=1;j<=n;j++) temp.ans[j]=cos(temp.ans[j]);
                v[i].push_back(temp);
            }
            for(int l=0;l<=i-2;l++){
                int r=i-2-l;
                for(auto &ll:v[l])
                    for(auto &rr:v[r]){
                        temp.eq="("+ll.eq+"+"+rr.eq+")";
                        for(int j=1;j<=n;j++) temp.ans[j]=ll.ans[j]+rr.ans[j];
                        v[i].push_back(temp);
                        temp.eq="("+ll.eq+"-"+rr.eq+")";
                        for(int j=1;j<=n;j++) temp.ans[j]=ll.ans[j]-rr.ans[j];
                        v[i].push_back(temp);
                        temp.eq="("+ll.eq+"*"+rr.eq+")";
                        for(int j=1;j<=n;j++) temp.ans[j]=ll.ans[j]*rr.ans[j];
                        v[i].push_back(temp);
                        int fl=1;
                        temp.eq="("+ll.eq+"/"+rr.eq+")";
                        for(int j=1;j<=n;j++){
                            if(rr.ans[j]==0){
                                fl=0;
                                break;
                            }
                            temp.ans[j]=ll.ans[j]/rr.ans[j];
                        }
                        if(fl) v[i].push_back(temp);
                    }
            }
            for(auto &t:v[i]){
                int fl=1;
                for(int j=1;j<=n;j++) if(fabs(t.ans[j]-b[j])>5e-7) fl=0;
                if(fl){
                    cout<<t.eq<<endl;
                    exit(0);
                }
            }
        }
    }
    return 0;
}