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

#define all(x) x.begin(), x.end()

using ld = long double;

set<int> ones, two;
vector<vector<int>> g;
vector<int> type;

vector<pair<ld, ld>> eq;

ld evaluate(ld x, int u) {
    if (g[u].size() == 0) return x;
    if (g[u].size() == 1) {
        if (type[u] == 0) return sin(evaluate(x, g[u][0]));
        if (type[u] == 1) return cos(evaluate(x, g[u][0]));
    }
    if (g[u].size() == 2) {
        switch (type[u]) {
            case 0: return evaluate(x, g[u][0]) + evaluate(x, g[u][1]);
            case 1: return evaluate(x, g[u][0]) - evaluate(x, g[u][1]);
            case 2: return evaluate(x, g[u][1]) - evaluate(x, g[u][0]);
            case 3: return evaluate(x, g[u][0]) * evaluate(x, g[u][1]);
            case 4: return evaluate(x, g[u][0]) / evaluate(x, g[u][1]);
            case 5: return evaluate(x, g[u][1]) / evaluate(x, g[u][0]);
        }
    }
}

string gen(int u) {
    if (g[u].size() == 0) return "x";
    if (g[u].size() == 1) {
        if (type[u] == 0) return "sin(" + gen(g[u][0]) + ")";
        if (type[u] == 1) return "cos(" + gen(g[u][0]) + ")";
    }
    if (g[u].size() == 2) {
        switch (type[u]) {
            case 0: return "(" + gen(g[u][0]) + ")+(" + gen(g[u][1]) + ")";
            case 1: return "(" + gen(g[u][0]) + ")-(" + gen(g[u][1]) + ")";
            case 2: return "(" + gen(g[u][1]) + ")-(" + gen(g[u][0]) + ")";
            case 3: return "(" + gen(g[u][0]) + ")*(" + gen(g[u][1]) + ")";
            case 4: return "(" + gen(g[u][0]) + ")/(" + gen(g[u][1]) + ")";
            case 5: return "(" + gen(g[u][1]) + ")/(" + gen(g[u][0]) + ")";
        }
    }
}

void gen2(int i) {
    if (i == g.size()) {
//        cout << gen(0) << endl;
        bool ok = 1;
        for (auto [x, y] : eq) {
            auto val = evaluate(x, 0);
            if (abs(val - y) / max((ld)1, abs(y)) <= 1e-3) {}
            else {
                ok = 0;
                break;
            }
        }
//        cout << 111 << endl;
        if (ok) {
            cout << gen(0);
            exit(0);
        }
        return;
    }
    if (g[i].size() == 0) {
        type[i] = 0;
        gen2(i + 1);
    } else if (g[i].size() == 1) {
        for (type[i] = 0; type[i] < 2; ++type[i]) gen2(i + 1);
    } else {
        for (type[i] = 0; type[i] < 6; ++type[i]) gen2(i + 1);
    }
}

void gen() {
//    cout << "----" << endl;
//    for (auto u : g) {
//        for (auto v : u) cout << v << ' ';
//        cout << endl;
//    }
    gen2(0);
//    cout << "----" << endl;
    if (g.size() == 10) return;
    int u = -1;
    int v = g.size();
    g.push_back({});
    type.push_back(0);
    two.insert(v);
    while (1) {
        auto o = ones.upper_bound(u);
        if (o == ones.end()) break;
        u = *o;
        ones.erase(u);
        g[u].push_back(v);
        gen();
        g[u].pop_back();
        ones.insert(u);
    }
    u = -1;
    while (1) {
        auto o = two.upper_bound(u);
        if (o == two.end()) break;
        u = *o;
        if (u == v) continue;
        two.erase(u);
        ones.insert(u);
        g[u].push_back(v);
        gen();
        g[u].pop_back();
        two.insert(u);
        ones.erase(u);
    }
    g.pop_back();
    two.erase(v);
    type.pop_back();
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int n;
    cin >> n;
    eq.resize(n);
    for (int i = 0; i < n; ++i) cin >> eq[i].first >> eq[i].second;
    g.push_back({});
    type.push_back(0);
    two.insert(0);
    gen();
}