#include<iostream>
#include <bits/stdc++.h>

#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 1e6 + 5, mod = 998244353;


vector<ll> v(3);

ll my_min(ll a, ll b) {
    if (a < 0 || b < 0) return max(a, b);
    return min(a, b);
}

ll solve(int i, ll x) {
    if (i == 3)return x;
    if (i == 0)return solve(i + 1, v[0]);
    ll ans = my_min(solve(i + 1, x + v[i]), solve(i + 1, x - v[i]));
    ans = my_min(ans, solve(i + 1, x * v[i]));
    if (x % v[i] == 0) {
        ans = my_min(ans, solve(i + 1, x / v[i]));
    }
    return ans;
}

void doWork() {
    cin >> v[0] >> v[1] >> v[2];
    cout << solve(0, 0);
}

int main() {
    IO
    int t = 1;
    //cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}