#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  ll T;
  cin >> T;

  ll X, A;
  cin >> X >> A;

  ll Y, B;
  cin >> Y >> B;
  ll min_cost = LLONG_MAX;

  if (T > 0) {
    ll d = T / A;

    for (ll i = 0; i <= 10000000; ++i) {
      ll step_cnt = d + i;
      ll al = step_cnt * A;
      ll cost = X * step_cnt;
      if (cost > T) break;

      if (T < al) {
        ll over_len = al - T;
        ll back_cnt = (over_len + B - 1) / B;
        al -= B * back_cnt;
        cost += Y * back_cnt;
      }

      ll remain = T - al;
      cost += remain;

      min_cost = min(min_cost, cost);
    }
  } else {
    ll d = (abs(T) + B - 1) / B;

    for (ll i = 0; i <= 10000000; ++i) {
      ll back_cnt = d + i;
      ll bl = -1 * back_cnt * B;
      ll cost = Y * back_cnt;

      ll remain = T - bl;
      ll step_cnt = remain / A;
      if (i > 0 && step_cnt > abs(T)) break;

      cost += X * step_cnt;
      remain -= A * step_cnt;
      cost += remain;

      min_cost = min(min_cost, cost);
    }
  }

  cout << min_cost << endl;

  return 0;
}