#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 25;
const double eps = 1e-3, eps2 = 0.01;
int n, m, top, a[N];//0:x 1:+ 2:- 3:* 4:/ 5:sin 6:cos
char ch[] = {'x', '+', '-', '*', '/'};
double x[N], y[N], st[N];
void dfs(int u, int tot, int cnt){
    
    if(cnt == 1){
        bool ok = 1;
        _rep(i, 1, n){
            top = 0;
            _rep(j, 1, u - 1){
                if(!a[j]) st[++top] = x[i];
                if(a[j] == 1) st[top - 1] = st[top] + st[top - 1], top--;
                if(a[j] == 2) st[top - 1] = st[top] - st[top - 1], top--;
                if(a[j] == 3) st[top - 1] = st[top] * st[top - 1], top--;
                if(a[j] == 4){
                    if(fabs(st[top - 1]) < eps2){
                        ok = 0;
                        break;
                    }
                    st[top - 1] = st[top] / st[top - 1], top--;
                }
                if(a[j] == 5) st[top] = sin(st[top]);
                if(a[j] == 6) st[top] = cos(st[top]);
            }
            if(!ok) break;
            if(fabsl(st[top] - y[i]) / max(1.00, fabs(y[i])) > eps){
                ok = 0;
                break;
            }
        }
        if(ok){
            stack<string> ans;
            _rep(i, 1, u - 1){
                if(!a[i]) ans.push("x");
                if(a[i] >= 1 && a[i] <= 4){
                    string ta = ans.top(); ans.pop();
                    string tb = ans.top(); ans.pop();
                    if(ta.size() > 1) ta = "(" + ta + ")";
                    if(tb.size() > 1) tb = "(" + tb + ")";
                    string cur = ta + ch[a[i]] + tb;
                    ans.push(cur);
                }
                if(a[i] >= 5){
                    string cur = ans.top(); ans.pop();
                    if(a[i] == 5) cur = "sin(" + cur + ")";
                    if(a[i] == 6) cur = "cos(" + cur + ")";
                    ans.push(cur);
                }
            }
            cout << ans.top() << endl;
            exit(0);
        }
    }
    if((9 - tot) / 2 >= cnt) a[u] = 0, dfs(u + 1, tot, cnt + 1);
    if(tot <= 7 && cnt >= 2){
        _rep(i, 1, 4){
            a[u] = i;
            dfs(u + 1, tot + 2, cnt - 1);
        }
    }
    if(tot <= 8 && cnt >= 1){
        _rep(i, 5, 6){
            a[u] = i;
            dfs(u + 1, tot + 1, cnt);
        }
    }
}
int main(){
    read(n);
    _rep(i, 1, n) scanf("%lf%lf", &x[i], &y[i]);
    dfs(1, 0, 0);
    return 0;
}