#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define MP make_pair
#define all(x) x.begin(),x.end()
#define Hagry ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);

using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
using vpi = vector <pair<int, int>>;
using vvi = vector <vector<int>>;

const int OO = 1e9 + 5;
const int N = 2e5 + 5;

int a[3];
int ans = OO;

void solve(int i, int val){
    if(i == 3){
        if(val >= 0)
            ans = min(ans, val);
        return;
    }

    solve(i+1, val+a[i]);
    solve(i+1, val-a[i]);
    solve(i+1, val*a[i]);
    if(val % a[i] == 0)
        solve(i+1, val/a[i]);
}

void TC(){
    for(int i=0; i<3; ++i)cin >> a[i];
    solve(1, a[0]);
    cout << ans;
}

int32_t main() {
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#endif
    Hagry
    int t = 1;
//    cin >> t;
    while (t--) {
        TC();
        cout << '\n';
    }
    return 0;
}