#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using dbl = long double;
vector<pair<vector<dbl>, string>> f[10];

vector<dbl> y;

bool chk(vector<dbl> &u) {
	for (int i = 0; i < y.size(); ++i) {
		if (fabs(u[i]-y[i]) > 1e-6) return false;
	}
	return true;
}

int main() {
	int n;
	cin >> n;
	vector<dbl> x;
	for (int i = 0; i < n; ++i) {
		dbl xi, yi;
		cin >> xi >> yi;
		x.emplace_back(xi);
		y.emplace_back(yi);
	}
	f[0].emplace_back(x, "x");
	if (chk(f[0][0].first)) {
		cout << "x\n";
		return 0;
	}
	for (int cost = 1; cost <= 9; ++cost) {
		for (const auto &[res, expr] : f[cost-1]) {
			vector<dbl> val;
			for (auto x : res) {
				val.push_back(sin(x));
			}
			string e = "sin("+expr+")";
			if (chk(val)) {
				cout << e << '\n';
				return 0;
			}
			f[cost].emplace_back(val, e);
		}
		for (const auto &[res, expr] : f[cost-1]) {
			vector<dbl> val;
			for (auto x : res) {
				val.push_back(cos(x));
			}
			string e = "cos("+expr+")";
			if (chk(val)) {
				cout << e << '\n';
				return 0;
			}
			f[cost].emplace_back(val, e);
		}
		for (int i = 0; i <= cost - 2; ++i) {
			for (const auto &[res_l, lhs] : f[i]) {
				for (const auto &[res_r, rhs] : f[cost-2-i]) {
					vector<dbl> val;
					for (int i = 0; i < res_l.size(); ++i) {
						val.push_back(res_l[i] + res_r[i]);
					}
					string e = "("+lhs+")+("+rhs+")";
					if (chk(val)) {
						cout << e << '\n';
						return 0;
					}
					f[cost].emplace_back(val, e);
				}
			}
		}
		for (int i = 0; i <= cost - 2; ++i) {
			for (const auto &[res_l, lhs] : f[i]) {
				for (const auto &[res_r, rhs] : f[cost-2-i]) {
					vector<dbl> val;
					for (int i = 0; i < res_l.size(); ++i) {
						val.push_back(res_l[i] - res_r[i]);
					}
					string e = "("+lhs+")-("+rhs+")";
					if (chk(val)) {
						cout << e << '\n';
						return 0;
					}
					f[cost].emplace_back(val, e);
				}
			}
		}
		for (int i = 0; i <= cost - 2; ++i) {
			for (const auto &[res_l, lhs] : f[i]) {
				for (const auto &[res_r, rhs] : f[cost-2-i]) {
					vector<dbl> val;
					for (int i = 0; i < res_l.size(); ++i) {
						val.push_back(res_l[i] * res_r[i]);
					}
					string e = "("+lhs+")*("+rhs+")";
					if (chk(val)) {
						cout << e << '\n';
						return 0;
					}
					f[cost].emplace_back(val, e);
				}
			}
		}
		for (int i = 0; i <= cost - 2; ++i) {
			for (const auto &[res_l, lhs] : f[i]) {
				for (const auto &[res_r, rhs] : f[cost-2-i]) {
					vector<dbl> val;
					bool has_zero = 0;
					for (auto v : res_r) {
						if (fabs(v) < 2e-2) has_zero = 1;
					}
					if (has_zero) continue;
					for (int i = 0; i < res_l.size(); ++i) {
						val.push_back(res_l[i] / res_r[i]);
					}
					string e = "("+lhs+")/("+rhs+")";
					if (chk(val)) {
						cout << e << '\n';
						return 0;
					}
					f[cost].emplace_back(val, e);
				}
			}
		}
	}
    return 0;
}