#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const int INF = 1000001000;
const int mod = 1000 * 1000 * 1000 + 7;
const int mod9 = 1000 * 1000 * 1000 + 9;
const double PI = 3.1415926535897932;
double sqr(double first) { return first * first; };
long double sqr(long double first) { return first * first; };
long long sqr(long long first) { return first * first; };
long long sqr(int first) { return first * 1LL * first; };
long long gcd(long long a, long long b) {
  while (b) a %= b, swap(a, b);
  return a;
}
long long bpm(long long a, long long n = -2, long long m = mod) {
  n = n >= 0 ? n : m + n;
  long long r = 1;
  while (n) {
    if (n & 1) r = (r * a) % m;
    a = (a * a) % m;
    n >>= 1;
  }
  return r;
}
long long dist(long long x1, long long y1, long long x2, long long y2) {
  return sqr(x1 - x2) + sqr(y1 - y2);
}
std::ostream& operator<<(std::ostream& os, pair<int, int> p) {
  return os << "{" << p.first << " " << p.second << "}";
}
const int N = 200002;
string d[] = {"x^y^z",   "x^z^y",   "(x^y)^z", "(x^z)^y", "y^x^z",   "y^z^x",
              "(y^x)^z", "(y^z)^x", "z^x^y",   "z^y^x",   "(z^x)^y", "(z^y)^x"};
long double f(long double first, long double second, long double z) {
  return pow(second, z) * log(first);
}
long double s(long double first, long double second, long double z) {
  return z * second * logl(first);
}
int main() {
  double first, second, z;
  cin >> first >> second >> z;
  long double a[12];
  a[0] = f(first, second, z);
  a[1] = f(first, z, second);
  a[2] = s(first, second, z);
  a[3] = s(first, z, second);
  a[4] = f(second, first, z);
  a[5] = f(second, z, first);
  a[6] = s(second, first, z);
  a[7] = s(second, z, first);
  a[8] = f(z, first, second);
  a[9] = f(z, second, first);
  a[10] = s(z, first, second);
  a[11] = s(z, second, first);
  int mId = 0;
  for (int i = 0; i < 11; i++)
    if (a[i] > a[mId]) mId = i;
  cout << d[mId] << "\n";
  return 0;
}
