#include <bits/stdc++.h>

#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void testCase() {
    int a, b, c;
    cin >> a >> b >> c;

    vector<int> v = {a + b + c, a + b - c, (a + b) * c,
                     a - b + c, a - b - c, (a - b) * c,
                     a * b + c, a * b - c, a * b * c,
                     };

    if ((a + b) % c == 0)
        v.push_back((a + b) / c);

    if ((a - b) % c == 0)
        v.push_back((a - b) / c);

    if (a * b % c == 0)
        v.push_back(a * b / c);

    if (a % b == 0) {
        v.push_back(a / b + c);
        v.push_back(a / b - c);
        v.push_back(a / b * c);

        if (a / b % c == 0)
            v.push_back(a / b / c);
    }

    sort(v.begin(), v.end());

    cout << *lower_bound(v.begin(), v.end(), 0);
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();
}