#include <bits/stdc++.h>
using namespace std;
long long pwr(long long base, long long p, long long mod = 1000000000) {
  long long ans = 1;
  while (p) {
    if (p & 1) ans = (ans * base) % 1000000000;
    base = (base * base) % 1000000000;
    p /= 2;
  }
  return ans;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first > b.first);
}
const long long N = 2e5 + 5;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  int a[3];
  for (int i = (1); i <= (3); ++i) cin >> a[i - 1];
  int x = a[0], y = a[1], z = a[2];
  sort(a, a + 3);
  if (n == 1)
    cout << 0;
  else {
    if (a[0] == x) {
      cout << (n - 1) * x;
    } else if (a[0] == y) {
      cout << (n - 1) * y;
    } else {
      cout << z * (n - 2) + a[1];
    }
  }
  return 0;
}
