#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long int N = 100100;
long long int h[N], prefix[N];
using namespace std;
long long int n, A, R, M;
long long int solve(long long int hh) {
  long long int pos = lower_bound(h, h + n, hh) - h;
  long long int res = 0;
  long long int k1 = hh * pos - prefix[pos];
  long long int k2 = prefix[n] - prefix[pos] - hh * (n - pos);
  long long int k = min(k1, k2);
  if (k1 > k2)
    res += (k1 - k2) * A;
  else
    res += (k2 - k1) * R;
  res += k * M;
  return res;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> A >> R >> M;
  M = min(M, A + R);
  prefix[0] = 0;
  for (long long int i = 0; i < n; ++i) {
    cin >> h[i];
  }
  sort(h, h + n);
  for (long long int i = 0; i < n; ++i) {
    prefix[i + 1] = prefix[i] + h[i];
  }
  long long int l = h[0];
  long long int r = h[n - 1];
  while ((r - l + 1) > 1e6) {
    long long int mid = (l + r) / 2;
    long long int c1 = solve(mid);
    long long int c2 = solve(mid + 1);
    if (c1 < c2) {
      r = mid;
    } else
      l = mid + 1;
  }
  long long int ans = 2e18 + 17;
  for (long long int i = l; i <= r; ++i) {
    ans = min(ans, solve(i));
  }
  cout << ans << '\n';
  return 0;
}

### Prompt

Generate a cpp solution to the following problem:

You have to restore the wall. The wall consists of N pillars of bricks, the height of the i-th pillar is initially equal to h_{i}, the height is measured in number of bricks. After the restoration all the N pillars should have equal heights.

You are allowed the following operations:

  * put a brick on top of one pillar, the cost of this operation is A;
  * remove a brick from the top of one non-empty pillar, the cost of this operation is R;
  * move a brick from the top of one non-empty pillar to the top of another pillar, the cost of this operation is M.



You cannot create additional pillars or ignore some of pre-existing pillars even if their height becomes 0.

What is the minimal total cost of restoration, in other words, what is the minimal total cost to make all the pillars of equal height?

Input

The first line of input contains four integers N, A, R, M (1 ≤ N ≤ 10^{5}, 0 ≤ A, R, M ≤ 10^{4}) — the number of pillars and the costs of operations.

The second line contains N integers h_{i} (0 ≤ h_{i} ≤ 10^{9}) — initial heights of pillars.

Output

Print one integer — the minimal cost of restoration.

Examples

Input


3 1 100 100
1 3 8


Output


12


Input


3 100 1 100
1 3 8


Output


9


Input


3 100 100 1
1 3 8


Output


4


Input


5 1 2 4
5 5 3 6 5


Output


4


Input


5 1 2 2
5 5 3 6 5


Output


3

### Response

```cpp
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long int N = 100100;
long long int h[N], prefix[N];
using namespace std;
long long int n, A, R, M;
long long int solve(long long int hh) {
  long long int pos = lower_bound(h, h + n, hh) - h;
  long long int res = 0;
  long long int k1 = hh * pos - prefix[pos];
  long long int k2 = prefix[n] - prefix[pos] - hh * (n - pos);
  long long int k = min(k1, k2);
  if (k1 > k2)
    res += (k1 - k2) * A;
  else
    res += (k2 - k1) * R;
  res += k * M;
  return res;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> A >> R >> M;
  M = min(M, A + R);
  prefix[0] = 0;
  for (long long int i = 0; i < n; ++i) {
    cin >> h[i];
  }
  sort(h, h + n);
  for (long long int i = 0; i < n; ++i) {
    prefix[i + 1] = prefix[i] + h[i];
  }
  long long int l = h[0];
  long long int r = h[n - 1];
  while ((r - l + 1) > 1e6) {
    long long int mid = (l + r) / 2;
    long long int c1 = solve(mid);
    long long int c2 = solve(mid + 1);
    if (c1 < c2) {
      r = mid;
    } else
      l = mid + 1;
  }
  long long int ans = 2e18 + 17;
  for (long long int i = l; i <= r; ++i) {
    ans = min(ans, solve(i));
  }
  cout << ans << '\n';
  return 0;
}

```