#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
constexpr int max_n = 500;
double eps = 1e-6;

struct layer {
  char op;
  int ld, rd;
  int ll, rl;
  vector<long double> value;
  layer(char op, int ld, int ll, int rd, int rl, vector<long double> value) : op(op), ld(ld), ll(ll), rd(rd), rl(rl), value(std::move(value)) {}

  string to_string();
};

vector<layer> fx[20];
vector<long double> ans;
int n;

string layer::to_string() {
  string s;
  switch (op) {
  case 's':
    s = "sin" + fx[ll][ld].to_string();
    break;
  case 'c':
    s = "cos" + fx[ll][ld].to_string();
    break;
  case '+':
  case '-':
  case '*':
  case '/':
    s = fx[ll][ld].to_string() + op + fx[rl][rd].to_string();
    break;
  case 'x':
    s = "x";
    break;
  }
  return "(" + s + ")";
}

bool equ(vector<ld>& x) {
  for (int i = 0; i < n; ++i) {
    if (abs(x[i] - ans[i]) > eps) return false;
  }
  return true;
}

void solve() {
  cin >> n;
  fx[0].emplace_back('x', 0, 0, 0, 0, vector<ld>(n));
  ans.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> fx[0][0].value[i] >> ans[i];
  }
  for (int i = 1; i <= 9; ++i) {
    for (int j = 0; j < fx[i - 1].size(); ++j) {
      fx[i].emplace_back('s', j, i - 1, 0, 0, vector<ld>(n));
      for (int k = 0; k < n; ++k) {
        fx[i].back().value[k] = sin(fx[i - 1][j].value[k]);
      }
      if (equ(fx[i].back().value)) {
        cout << fx[i].back().to_string() << '\n';
        return;
      }
      fx[i].emplace_back('c', j, i - 1, 0, 0, vector<ld>(n));
      for (int k = 0; k < n; ++k) {
        fx[i].back().value[k] = cos(fx[i - 1][j].value[k]);
      }
      if (equ(fx[i].back().value)) {
        cout << fx[i].back().to_string() << '\n';
        return;
      }
    }
    for (int j = 0, jj; j <= i - 2; ++j) {
      jj = i - 2 - j;
      for (int l = 0; l < fx[j].size(); ++l) {
        for (int r = 0; r < fx[jj].size(); ++r) {
          fx[i].emplace_back('+', l, j, r, jj, vector<ld>(n));
          for (int k = 0; k < n; ++k) {
            fx[i].back().value[k] = fx[j][l].value[k] + fx[jj][r].value[k];
          }
          if (equ(fx[i].back().value)) {
            cout << fx[i].back().to_string() << '\n';
            return;
          }

          fx[i].emplace_back('-', l, j, r, jj, vector<ld>(n));
          for (int k = 0; k < n; ++k) {
            fx[i].back().value[k] = fx[j][l].value[k] - fx[jj][r].value[k];
          }
          if (equ(fx[i].back().value)) {
            cout << fx[i].back().to_string() << '\n';
            return;
          }

          fx[i].emplace_back('*', l, j, r, jj, vector<ld>(n));
          for (int k = 0; k < n; ++k) {
            fx[i].back().value[k] = fx[j][l].value[k] * fx[jj][r].value[k];
          }
          if (equ(fx[i].back().value)) {
            cout << fx[i].back().to_string() << '\n';
            return;
          }

          fx[i].emplace_back('/', l, j, r, jj, vector<ld>(n));
          for (int k = 0; k < n; ++k) {
            if (abs(fx[jj][r].value[k]) < 0.15) {
              fx[i].pop_back();
              break;
            }
            fx[i].back().value[k] = fx[j][l].value[k] / fx[jj][r].value[k];
          }
          if (equ(fx[i].back().value)) {
            cout << fx[i].back().to_string() << '\n';
            return;
          }
        }
      }
    }
  }
//  for (int i =0; i <= 9; ++i) {
//    for (auto& item: fx[i]) {
//      cout << item.to_string();
//      for (auto& v: item.value) {
//        cout << ",  " << v;
//      }
//      cout << '\n';
//    }
//  }
}

int main() {
//  freopen("code.out", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
//    cin >> T;
//    scanf("%d", &T);
    for (int i = 1; i <= T; ++i) {
        // cout << "Case " << i << ": ";
        solve();
    }
    return 0;
}

/*
3 3
2.4.2
.....
4.8.4
.....
2.5.3

5 5
3.4.4.4.2
.........
4.7.7.7.4
.........
4.8.7.7.4
.........
4.7.7.7.5
.........
2.4.4.4.2
*/