1.0 200.0 200.0
 0.2 0.1 0.6
 1.9 3.0 4.1
 51.8 51.8 7.1
 113.9 125.2 88.8
 1.9 4.8 3.9
 2.2 148.1 138.0
 1.0 200.0 1.0
 1.7 4.5 4.2
 0.2 0.6 0.3
 200.0 200.0 0.1
 3.9 0.2 3.8
 7.0 131.1 7.4
 4.6 4.4 2.3
 2.0 1.1 2.4
 2.4 3.8 2.7
 0.1 0.5 0.2
 1.8 0.4 2.7
 1.1 1.1 1.1
 3.7 2.2 4.8
 3.9 2.1 4.5
 1.0 1.0 200.0
 104.6 184.4 82.3
 149.4 15.5 82.0
 0.5 0.5 0.6
 1.1 1.5 1.0
 0.3 0.4 0.4
 0.3 0.5 0.6
 0.2 0.2 0.5
 1.0 1.0 1.0
 0.2 0.7 0.6
 144.0 70.4 148.1
 25.9 77.0 144.8
 0.9 1.0 0.1
 0.5 0.3 0.2
 2.0 1.0 4.0
 4.0 2.0 1.0
 1.0 2.0 4.0
 0.5 0.5 0.1
 0.6 0.2 0.5
 185.9 9.6 163.4
 0.8 0.3 0.6
 200.0 1.0 200.0
 1.1 3.1 4.9
 3.7 3.7 4.1
 0.1 0.2 0.6
 1.5 1.3 0.1
 4.6 2.1 1.6
 0.1 200.0 0.1
 1.0 0.3 1.1
 0.3 0.3 0.5
 0.1 0.1 0.4
 55.5 159.4 140.3
 4.4 3.7 3.4
 200.0 1.0 1.0
 0.1 1.4 0.3
 1.4 0.5 0.8
 1.1 1.5 0.4
 51.5 156.3 145.1
 0.1 0.3 0.5
 153.9 122.1 89.5
 1.8 1.8 2.1
 0.5 0.1 0.9
 0.6 0.6 1.1
 4.6 3.0 3.4
 0.1 0.4 0.3
 0.6 0.3 0.2
 196.9 3.0 4.1
 3.0 3.0 3.1
 4.4 0.5 2.0
 4.5 1.3 4.8
 64.6 117.1 81.6
 117.4 68.8 137.7
 141.1 108.1 14.9
 81.7 171.9 4.4
 0.2 0.3 0.1
 156.9 154.8 73.9
 1.5 1.4 1.1
 0.4 1.1 0.9
 0.4 1.1 0.8
 0.1 200.0 200.0
 0.5 0.3 0.1
 1.0 2.0 1.0
 1.4 1.1 1.0
 0.7 1.4 0.4
 28.9 39.3 148.4
 1.7 1.9 4.4
 0.5 0.8 0.3
 200.0 0.1 0.1
 0.5 0.2 0.2
 0.6 0.4 0.3
 0.9 1.2 0.2
 4.3 2.4 4.9
 0.9 2.0 4.8
 189.4 63.7 63.4
 38.7 142.2 89.8
 0.3 0.4 0.1
 1.9 1.1 4.8
 0.4 0.1 0.6
 4.2 1.1 1.2
 1.5 1.7 2.5
 184.1 118.5 129.5
 200.0 200.0 200.0
 0.5 0.4 0.5
 1.2 0.7 1.3
 3.9 4.3 3.4
 193.9 40.7 19.7
 0.5 0.2 0.3
 36.9 51.1 4.8
 0.2 0.1 0.2
 0.2 0.6 0.4
 0.1 0.1 200.0
 0.9 4.6 3.4
 2.0 4.0 1.0
 0.2 0.3 0.2
 0.4 1.0 1.5
 1.4 1.2 1.4
 1.2 0.6 0.5
 2.0 2.1 2.2
 0.1 0.2 0.3
 0.8 0.4 1.4
 1.4 0.3 1.4
 4.0 1.0 2.0
 0.1 0.5 0.4
 0.4 0.2 0.3
 4.0 0.4 3.1
 200.0 0.1 200.0
 1.0 4.0 2.0
 0.3 0.4 1.2
 94.5 56.3 59.8
 1.4 0.8 0.9
 200.0 200.0 1.0
 1.4 0.8 0.2
 3.9 0.7 4.7
 144.6 103.0 193.4
 0.5 0.1 0.3
 0.1 0.4 0.2
 0.1 0.1 0.1
 1.2 0.5 1.2
 198.7 23.7 89.1
 139.3 87.4 129.9
 4.1 3.5 4.5
 2.2 3.1 3.0
 91.8 170.4 7.7
 41.7 104.5 74.2

y^z^x
 (z^x)^y
 x^y^z
 z^x^y
 z^x^y
 x^z^y
 x^z^y
 y^x^z
 x^z^y
 (y^x)^z
 (x^y)^z
 x^z^y
 x^z^y
 z^y^x
 (z^x)^y
 x^z^y
 (y^x)^z
 z^x^y
 (x^y)^z
 y^x^z
 y^x^z
 z^x^y
 z^x^y
 y^z^x
 (z^x)^y
 y^x^z
 (y^x)^z
 (z^x)^y
 (z^x)^y
 x^y^z
 (y^x)^z
 y^x^z
 x^y^z
 y^x^z
 (x^y)^z
 x^z^y
 x^y^z
 y^z^x
 (x^y)^z
 (x^y)^z
 y^z^x
 (x^y)^z
 x^z^y
 x^y^z
 x^y^z
 (z^x)^y
 x^y^z
 z^y^x
 y^x^z
 z^x^y
 (z^x)^y
 (z^x)^y
 x^z^y
 z^y^x
 x^y^z
 y^z^x
 x^z^y
 y^x^z
 x^z^y
 (z^x)^y
 z^y^x
 (z^x)^y
 (z^x)^y
 z^x^y
 y^z^x
 (y^x)^z
 (x^y)^z
 y^z^x
 x^y^z
 x^z^y
 y^x^z
 x^z^y
 y^x^z
 z^y^x
 z^x^y
 (y^x)^z
 z^y^x
 (x^y)^z
 y^z^x
 y^z^x
 (y^x)^z
 (x^y)^z
 y^x^z
 x^y^z
 y^x^z
 x^y^z
 x^y^z
 (y^x)^z
 x^y^z
 (x^y)^z
 (x^y)^z
 y^x^z
 y^x^z
 (y^x)^z
 z^y^x
 x^z^y
 (y^x)^z
 x^z^y
 (z^x)^y
 (x^y)^z
 (z^x)^y
 y^z^x
 x^y^z
 (x^y)^z
 z^x^y
 z^x^y
 z^y^x
 (x^y)^z
 z^x^y
 (x^y)^z
 (y^x)^z
 z^x^y
 (z^x)^y
 x^y^z
 (y^x)^z
 z^y^x
 (x^y)^z
 x^y^z
 x^z^y
 (z^x)^y
 z^x^y
 x^z^y
 x^z^y
 (y^x)^z
 (x^y)^z
 x^z^y
 (x^y)^z
 y^z^x
 z^y^x
 y^z^x
 x^z^y
 x^y^z
 x^y^z
 (x^y)^z
 y^x^z
 (x^y)^z
 (y^x)^z
 (x^y)^z
 x^z^y
 y^z^x
 y^z^x
 y^x^z
 x^z^y
 z^x^y
 x^z^y

#include <bits/stdc++.h>
using namespace std;
long long mInv[41];
long long fact[41];
long long factInv[41];
map<long, long> mymap;
set<string> dictionary;
set<string>::iterator it;
pair<set<string>::iterator, bool> ret;
long long getmoduloInv(long long n) {
  if (n == 1) return 1;
  if (mInv[n] > 0) return mInv[n];
  long long m = (-1 * 1000000007) / n;
  m += 1000000007;
  m *= getmoduloInv(1000000007 % n);
  mInv[n] = (m % 1000000007);
  return mInv[n];
}
double getDist(double x1, double y1, double x2, double y2, double x3,
               double y3) {
  double dist1 = ((x1 - x3) * (x1 - x3)) + ((y1 - y3) * (y1 - y3));
  double dist2 = ((x2 - x3) * (x2 - x3)) + ((y2 - y3) * (y2 - y3));
  double dist3 = ((x1 - x2) * (x1 - x2)) + ((y1 - y2) * (y1 - y2));
  if (dist3 < 0.00000002) return (dist1 + dist2) / 2;
  if (dist1 < dist2)
    return getDist(x1, y1, (x1 + x2) / 2, (y1 + y2) / 2, x3, y3);
  return getDist(x2, y2, (x1 + x2) / 2, (y1 + y2) / 2, x3, y3);
}
long long C[100005], N, L, M, D;
long long cumCost[100005];
long findPos(long val) {
  long long pos = 0, total = 0;
  while (cumCost[pos] <= val) {
    pos++;
  }
  return pos;
}
long long x[2020], y[2020];
typedef pair<long long, long long> flower;
vector<flower> flowers;
void printVal(long long v) {
  if (v < 1) return;
  long long temp = 1, val = 0;
  while (temp <= v) {
    val++;
    temp = temp << 1;
  }
  cout << val << " ";
  if (temp > v) printVal(v - (temp / 2));
}
double vals[13];
void fillVals(double b, double p1, double p2, long startPoint) {
  if (b < 1.0)
    vals[startPoint] = vals[startPoint + 1] = vals[startPoint + 2] = 0.0;
  else {
    vals[startPoint] = log(log(b)) + p2 * log(p1);
    vals[startPoint + 1] = log(log(b)) + p1 * log(p2);
    vals[startPoint + 2] = log(log(b)) + log(p1) + log(p2);
  }
}
int main(void) {
  long long test_cases = 1;
  cout << setprecision(15) << fixed;
  long long n;
  bool found = false;
  double x, y, z;
  cin >> x >> y >> z;
  if (x < 4 && y < 4 && z < 4) {
    vals[0] = pow(x, (pow(y, z)));
    vals[1] = pow(x, (pow(z, y)));
    vals[2] = pow(x, (y * z));
    vals[3] = pow(y, (pow(x, z)));
    vals[4] = pow(y, (pow(z, x)));
    vals[5] = pow(y, (x * z));
    vals[6] = pow(z, (pow(x, y)));
    vals[7] = pow(z, (pow(y, x)));
    vals[8] = pow(z, (x * y));
  } else {
    fillVals(x, y, z, 0);
    fillVals(y, x, z, 3);
    fillVals(z, x, y, 6);
  }
  long minPos = 0;
  for (long i = 1; i < 9; i++) {
    if (vals[i] > vals[minPos] + 0.00000002) minPos = i;
  }
  if (minPos == 0)
    cout << "x^y^z" << endl;
  else if (minPos == 1)
    cout << "x^z^y" << endl;
  else if (minPos == 2)
    cout << "(x^y)^z" << endl;
  if (minPos == 3)
    cout << "y^x^z" << endl;
  else if (minPos == 4)
    cout << "y^z^x" << endl;
  else if (minPos == 5)
    cout << "(y^x)^z" << endl;
  if (minPos == 6)
    cout << "z^x^y" << endl;
  else if (minPos == 7)
    cout << "z^y^x" << endl;
  else if (minPos == 8)
    cout << "(z^x)^y" << endl;
  return 0;
}
