#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int moves, a, b, c, n, i, j, k = 0;
  cin >> moves >> a >> b >> c;
  vector<long long int> v(3);
  v[0] = a;
  v[1] = b;
  v[2] = c;
  sort(v.begin(), v.end());
  if (moves == 1) {
    cout << 0;
    return 0;
  }
  {
    if (v[0] == a || v[0] == b)
      k += v[0] * (moves - 1);
    else {
      k += (min(a, b) + (moves - 2) * v[0]);
    }
    cout << k;
  }
  return 0;
}
