#include <bits/stdc++.h>
using namespace std;
long long n;
map<long long, string> mp;
string toString(long long x) {
  if (x == 0) return "0";
  string s = "";
  while (x != 0) {
    s = s + (char)(x % 10 + 48);
    x /= 10;
  }
  reverse(s.begin(), s.end());
  return s;
}
int main() {
  cin >> n;
  for (int i = 2; i <= 100000; ++i) {
    long long x = i;
    for (int j = 2;; ++j) {
      x *= i;
      if (x > n) break;
      string s = toString(i) + "^" + toString(j);
      if (mp.count(x) == 0) mp[x] = toString(x);
      if (mp[x].size() > s.size()) mp[x] = s;
    }
  }
  string ans = toString(n);
  for (auto e : mp) {
    if (n % e.first == 0) {
      string s;
      long long div = n / e.first;
      if (div != 1) {
        if (mp.count(div) != 0)
          s = e.second + "*" + mp[div];
        else
          s = e.second + "*" + toString(div);
      } else
        s = e.second;
      if (s.size() < ans.size()) ans = s;
    } else {
      string s = e.second;
      long long div = n / e.first;
      long long rem = n % e.first;
      if (div != 1) {
        if (mp.count(div) != 0)
          s = s + "*" + mp[div];
        else
          s = s + "*" + toString(div);
      }
      if (rem != 0) {
        if (mp.count(rem) != 0)
          s = s + "+" + mp[rem];
        else
          s = s + "+" + toString(rem);
      }
      if (s.size() < ans.size()) ans = s;
    }
    {
      string s = "";
      long long sub = n - e.first;
      if (sub != 0) {
        if (mp.count(sub))
          s = e.second + "+" + mp[sub];
        else
          s = e.second + "+" + toString(sub);
      } else
        s = e.second;
      if (s.size() < ans.size()) ans = s;
    }
  }
  cout << ans << endl;
  return 0;
}
