#include <bits/stdc++.h>
using namespace std; namespace {
    using T = long double;
    const char endl = '\n';
    const int maxN = 1e6 + 5;
    const string uops = "sc";
    const string bops = "+-*/";

    using Arr = array<T, 21>;

    int n;
    Arr x, y;
    struct S { char op; int ld, li, rd, ri; Arr x; };
    vector<S> f[10];

    Arr uop(char op, const Arr& a) { 
        Arr ret;
        if(op == 's') for(int i = 1; i <= n; i++) ret[i] = sin(a[i]);
        if(op == 'c') for(int i = 1; i <= n; i++) ret[i] = cos(a[i]);
        return ret;
    }
    pair<Arr, bool> bop(char op, const Arr& a, const Arr& b) {
        Arr ret;
        if(op == '+') for(int i = 1; i <= n; i++) ret[i] = a[i] + b[i];
        if(op == '-') for(int i = 1; i <= n; i++) ret[i] = a[i] - b[i];
        if(op == '*') for(int i = 1; i <= n; i++) ret[i] = a[i] * b[i];
        if(op == '/') {
            for(int i = 1; i <= n; i++) if(b[i] < 0.01) return { Arr{}, false };
            for(int i = 1; i <= n; i++) ret[i] = a[i] / b[i];
        }
        return { ret, true };
    }
    T diff(const Arr& a) {
        T ret = 0;
        for(int i = 1; i <= n; i++) 
            ret = max(ret, abs(a[i] - y[i]) / max<T>(1, abs(y[i])));
        return ret;
    }

    void print(const S& s, bool fst = true) {
        if(s.op == 'x') return cout << 'x', void();
        if(s.op == 's') return cout << "sin(", print(f[s.ld][s.li], false), cout << ')', void();
        if(s.op == 'c') return cout << "cos(", print(f[s.ld][s.li], false), cout << ')', void();
        if(!fst) cout << '(';
        print(f[s.ld][s.li], false);
        cout << s.op;
        print(f[s.rd][s.ri], false);
        if(!fst) cout << ')';
    }
   
    void solve() {  
        cin >> n;
        for(int i = 1; i <= n; i++) cin >> x[i] >> y[i];
        f[0].push_back(S{ 'x', -1, -1, -1, -1, x });
        for(int d = 1; d <= 9; d++) {
            for(int i = 0; i < f[d - 1].size(); i++) 
                for(char op : uops) 
                    f[d].push_back(S{ op, d - 1, i, -1, -1, uop(op, f[d - 1][i].x) });
            for(int ld = 0, rd = d - 2; ld <= d - 2; rd = d - ++ld - 2) 
                for(int li = 0; li < f[ld].size(); li++)
                    for(int ri = 0; ri < f[rd].size(); ri++) 
                        for(char op : bops) {
                            auto [x, ok] = bop(op, f[ld][li].x, f[rd][ri].x);
                            if(!ok) continue;
                            f[d].push_back(S{ op, ld, li, rd, ri, x });
                        }
            for(auto& s : f[d]) if(diff(s.x) < 1e-3) {
                print(s);
                return;
            }
        }   
        cout << "??";
        abort();
    }   
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1; // cin >> t;
    for(int i = 1; i <= t; i++) solve();
}