#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>

#define el '\n'
#define F first
#define S second

typedef long long ll;
typedef long double ld;
typedef __int128 bigInt;

using namespace std;

const ll N = 4e5 + 5, INF = 1e14 + 5, mod = 1e9 + 7, LOG = 21, SQ = 500;

ll op(ll a, ll b, int type) {
    if (type == 0) {
        return a + b;
    }
    else if (type == 1) {
        return a - b;
    }
    else if (type == 2) {
        return a * b;
    }
    else if (type == 3) {
        return (a % b ? -INF : a / b);
    }
}

void doWork() {
    vector<ll> v(3);
    for (auto &i : v) {
        cin >> i;
    }

    ll ans = INF;

    for (int i = 0; i < 4; i++) {
        ll res = op(v[0], v[1], i);

        if (res == -INF) {
            continue;
        }

        for (int j = 0; j < 4; j++) {
            ll cur = op(res, v[2], j);

            if (cur >= 0) {
                ans = min(ans, cur);
            }
        }
    }

    cout << ans << el;
}

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int tests = 1;
//    cin >> tests;
    for (int i = 1; i <= tests; i++) {
        doWork();
    }
}