#include <bits/stdc++.h>
using namespace std;
vector<int> solve(const vector<vector<int>> _comm) {
  vector<int> profit;
  for (int i = 0; i < _comm.size(); ++i) {
    int max_commands = (int)(_comm[i].front() / 2);
    int beef = _comm[i][1];
    int chicken = _comm[i][2];
    int beef_price = _comm[i][3];
    int chicken_price = _comm[i][4];
    int curr_profit = 0;
    if (beef_price > chicken_price) {
      if (beef <= max_commands) {
        curr_profit += beef * beef_price;
        max_commands -= beef;
      } else {
        curr_profit += max_commands * beef_price;
        beef -= max_commands;
        max_commands = 0;
      }
      if (max_commands != 0) {
        if (chicken > max_commands)
          curr_profit += max_commands * chicken_price;
        else if (chicken <= max_commands)
          curr_profit += chicken * chicken_price;
        max_commands = 0;
      }
    } else if (beef_price < chicken_price) {
      if (chicken <= max_commands) {
        curr_profit += chicken * chicken_price;
        max_commands -= chicken;
      } else {
        curr_profit += max_commands * chicken_price;
        chicken -= max_commands;
        max_commands = 0;
      }
      if (max_commands != 0) {
        if (beef > max_commands)
          curr_profit += max_commands * beef_price;
        else if (beef <= max_commands)
          curr_profit += beef * beef_price;
      }
    } else {
      int total_meat = chicken + beef;
      if (total_meat <= max_commands)
        curr_profit += total_meat * beef_price;
      else if (total_meat > max_commands)
        curr_profit += max_commands * beef_price;
    }
    profit.push_back(curr_profit);
  }
  return profit;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<vector<int>> comm(n);
  for (int i = 0; i < n; ++i) {
    int b, p, f, h, c;
    cin >> b >> p >> f >> h >> c;
    comm[i].push_back(b);
    comm[i].push_back(p);
    comm[i].push_back(f);
    comm[i].push_back(h);
    comm[i].push_back(c);
  }
  vector<int> _prof = solve(comm);
  for (int val : _prof) cout << val << "\n";
  return 0;
}

### Prompt

Your task is to create a cpp solution to the following problem:

There are two types of burgers in your restaurant — hamburgers and chicken burgers! To assemble a hamburger you need two buns and a beef patty. To assemble a chicken burger you need two buns and a chicken cutlet. 

You have b buns, p beef patties and f chicken cutlets in your restaurant. You can sell one hamburger for h dollars and one chicken burger for c dollars. Calculate the maximum profit you can achieve.

You have to answer t independent queries.

Input

The first line contains one integer t (1 ≤ t ≤ 100) – the number of queries.

The first line of each query contains three integers b, p and f (1 ≤ b, ~p, ~f ≤ 100) — the number of buns, beef patties and chicken cutlets in your restaurant.

The second line of each query contains two integers h and c (1 ≤ h, ~c ≤ 100) — the hamburger and chicken burger prices in your restaurant.

Output

For each query print one integer — the maximum profit you can achieve.

Example

Input


3
15 2 3
5 10
7 5 2
10 12
1 100 100
100 100


Output


40
34
0

Note

In first query you have to sell two hamburgers and three chicken burgers. Your income is 2 ⋅ 5 + 3 ⋅ 10 = 40.

In second query you have to ell one hamburgers and two chicken burgers. Your income is 1 ⋅ 10 + 2 ⋅ 12 = 34.

In third query you can not create any type of burgers because because you have only one bun. So your income is zero.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
vector<int> solve(const vector<vector<int>> _comm) {
  vector<int> profit;
  for (int i = 0; i < _comm.size(); ++i) {
    int max_commands = (int)(_comm[i].front() / 2);
    int beef = _comm[i][1];
    int chicken = _comm[i][2];
    int beef_price = _comm[i][3];
    int chicken_price = _comm[i][4];
    int curr_profit = 0;
    if (beef_price > chicken_price) {
      if (beef <= max_commands) {
        curr_profit += beef * beef_price;
        max_commands -= beef;
      } else {
        curr_profit += max_commands * beef_price;
        beef -= max_commands;
        max_commands = 0;
      }
      if (max_commands != 0) {
        if (chicken > max_commands)
          curr_profit += max_commands * chicken_price;
        else if (chicken <= max_commands)
          curr_profit += chicken * chicken_price;
        max_commands = 0;
      }
    } else if (beef_price < chicken_price) {
      if (chicken <= max_commands) {
        curr_profit += chicken * chicken_price;
        max_commands -= chicken;
      } else {
        curr_profit += max_commands * chicken_price;
        chicken -= max_commands;
        max_commands = 0;
      }
      if (max_commands != 0) {
        if (beef > max_commands)
          curr_profit += max_commands * beef_price;
        else if (beef <= max_commands)
          curr_profit += beef * beef_price;
      }
    } else {
      int total_meat = chicken + beef;
      if (total_meat <= max_commands)
        curr_profit += total_meat * beef_price;
      else if (total_meat > max_commands)
        curr_profit += max_commands * beef_price;
    }
    profit.push_back(curr_profit);
  }
  return profit;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<vector<int>> comm(n);
  for (int i = 0; i < n; ++i) {
    int b, p, f, h, c;
    cin >> b >> p >> f >> h >> c;
    comm[i].push_back(b);
    comm[i].push_back(p);
    comm[i].push_back(f);
    comm[i].push_back(h);
    comm[i].push_back(c);
  }
  vector<int> _prof = solve(comm);
  for (int val : _prof) cout << val << "\n";
  return 0;
}

```