#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


using Double = long double;

constexpr int COST = 9;
constexpr Double EPS = 0.9e-3;
constexpr Double DIV = 0.011;

int N;
vector<Double> X, Y;

int main() {
  for (; ~scanf("%d", &N); ) {
    X.resize(N);
    Y.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%Lf%Lf", &X[i], &Y[i]);
    }
    
    using S = pair<string, vector<Double>>;
    vector<S> dp[COST + 1];
    {
      S ini;
      ini.first = "x";
      ini.second = X;
      dp[0].push_back(ini);
    }
    for (int j = 1; j <= COST; ++j) {
      // binary
      for (int k = 0; k <= j - 2 - k; ++k) {
        for (const S &f : dp[k]) for (const S &g : dp[j - 2 - k]) {
          for (int op = 0; op < 6; ++op) {
            [&]() -> void {
              S h;
              if (op < 4) {
                h.first = "(" + f.first + "+-*/"[op] + g.first + ")";
              } else {
                h.first = "(" + g.first + "-/"[op - 4] + f.first + ")";
              }
              h.second.resize(N);
              for (int i = 0; i < N; ++i) {
                if (op == 3 && abs(g.second[i]) < DIV) return;
                if (op == 5 && abs(f.second[i]) < DIV) return;
                switch (op) {
                  case 0: h.second[i] = f.second[i] + g.second[i]; break;
                  case 1: h.second[i] = f.second[i] - g.second[i]; break;
                  case 2: h.second[i] = f.second[i] * g.second[i]; break;
                  case 3: h.second[i] = f.second[i] / g.second[i]; break;
                  case 4: h.second[i] = g.second[i] - f.second[i]; break;
                  case 5: h.second[i] = g.second[i] / f.second[i]; break;
                  default: assert(false);
                }
              }
              dp[j].push_back(h);
            }();
          }
        }
      }
      // unary
      for (const S &f : dp[j - 1]) {
        for (int op = 0; op < 2; ++op) {
          S g;
          g.first = string() + "(" + ((op == 0) ? "sin" : "cos") + "(" + f.first + ")" + ")";
          g.second.resize(N);
          for (int i = 0; i < N; ++i) {
            switch (op) {
              case 0: g.second[i] = sin(f.second[i]); break;
              case 1: g.second[i] = cos(f.second[i]); break;
              default: assert(false);
            }
          }
          dp[j].push_back(g);
        }
      }
cerr<<"|dp["<<j<<"]| = "<<dp[j].size()<<endl;
    }
    
    for (int j = 0; j <= COST; ++j) {
      for (const S &f : dp[j]) {
        bool ok = true;
        for (int i = 0; i < N; ++i) {
          ok = ok && (abs(f.second[i] - Y[i]) / max(1.0L, abs(Y[i])) <= EPS);
        }
        if (ok) {
          puts(f.first.c_str());
          goto found;
        }
      }
    }
    // puts("HELP");
    assert(false);
   found:{}
  }
  return 0;
}