#include <cstdio>
#include <queue>
#include <vector>

using namespace std;

int main() {
  vector<int> v(3);
  for(auto& x: v) scanf("%d", &x);
  queue<vector<int>> q;
  int ret = 1e9;
  q.push(v);
  while(q.size()) {
    v = q.front(); q.pop();
    if(v.size() == 1) {
      if(v[0] >= 0) {
        ret = min(ret, v[0]);
      }
      continue;
    }
    {
      vector<int> nv = v;
      nv[0] += nv[1]; nv.erase(nv.begin() + 1);
      q.push(nv);
    }
    {
      vector<int> nv = v;
      nv[0] -= nv[1]; nv.erase(nv.begin() + 1);
      q.push(nv);
    }
    {
      vector<int> nv = v;
      nv[0] *= nv[1]; nv.erase(nv.begin() + 1);
      q.push(nv);
    }
    {
      vector<int> nv = v;
      if(nv[1] && nv[0] % nv[1] == 0) {
        nv[0] /= nv[1];
        nv.erase(nv.begin() + 1);
        q.push(nv);
      }
    }
  }
  printf("%d\n", ret);
}