#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const long long ooo = 9223372036854775807ll;
const int _cnt = 1000 * 1000 + 7;
const int _p = 1000 * 1000 * 1000 + 7;
const int N = 1000005;
const double PI = acos(-1.0);
const double eps = 1e-9;
int o(int x) { return x % _p; }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
void file_put() {
  freopen("filename.in", "r", stdin);
  freopen("filename.out", "w", stdout);
}
int ans1 = oo, ans2 = oo;
int n, a, b, c;
int main() {
  scanf("%d", &n);
  scanf("%d%d%d", &a, &b, &c);
  if (a < b) {
    ans1 = (n - 1) * a;
  } else {
    ans1 = (n - 1) * b;
  }
  ans1 = ((ans1) < (((a) < (b) ? (a) : (b)) + (n - 2) * c)
              ? (ans1)
              : (((a) < (b) ? (a) : (b)) + (n - 2) * c));
  if (n == 1) ans1 = 0;
  printf("%d\n", ans1);
  return 0;
}
