#include <stdio.h>
#define INF 100000000
int min(int a, int b) {
return a < b ? a : b;
}
int main() {
int n;
int s, sn; // s: 値段, sn: 卵の数
int m, mn;
int l, ln;
scanf("%d %d", &sn
, &s
); // Sパック:sn個入り, s円 scanf("%d %d", &mn
, &m
); // Mパック:mn個入り, m円 scanf("%d %d", &ln
, &l
); // Lパック:ln個入り, l円
int sum = INF;
// 最大でもnより少し多くなるまで探索すれば十分
for (int i = 0; i <= n / sn + 10; i++) {
for (int j = 0; j <= n / mn + 10; j++) {
for (int k = 0; k <= n / ln + 10; k++) {
int total_eggs = i * sn + j * mn + k * ln;
if (total_eggs >= n) {
int cost = i * s + j * m + k * l;
sum = min(sum, cost);
}
}
}
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNkZWZpbmUgSU5GIDEwMDAwMDAwMAoKaW50IG1pbihpbnQgYSwgaW50IGIpIHsKICAgIHJldHVybiBhIDwgYiA/IGEgOiBiOwp9CgppbnQgbWFpbigpIHsKICAgIGludCBuOwogICAgaW50IHMsIHNuOyAgLy8gczog5YCk5q61LCBzbjog5Y2144Gu5pWwCiAgICBpbnQgbSwgbW47CiAgICBpbnQgbCwgbG47CgogICAgc2NhbmYoIiVkIiwgJm4pOwogICAgc2NhbmYoIiVkICVkIiwgJnNuLCAmcyk7ICAvLyBT44OR44OD44Kv77yac27lgIvlhaXjgoosIHPlhoYKICAgIHNjYW5mKCIlZCAlZCIsICZtbiwgJm0pOyAgLy8gTeODkeODg+OCr++8mm1u5YCL5YWl44KKLCBt5YaGCiAgICBzY2FuZigiJWQgJWQiLCAmbG4sICZsKTsgIC8vIEzjg5Hjg4Pjgq/vvJpsbuWAi+WFpeOCiiwgbOWGhgoKICAgIGludCBzdW0gPSBJTkY7CgogICAgLy8g5pyA5aSn44Gn44KCbuOCiOOCiuWwkeOBl+WkmuOBj+OBquOCi+OBvuOBp+aOoue0ouOBmeOCjOOBsOWNgeWIhgogICAgZm9yIChpbnQgaSA9IDA7IGkgPD0gbiAvIHNuICsgMTA7IGkrKykgewogICAgICAgIGZvciAoaW50IGogPSAwOyBqIDw9IG4gLyBtbiArIDEwOyBqKyspIHsKICAgICAgICAgICAgZm9yIChpbnQgayA9IDA7IGsgPD0gbiAvIGxuICsgMTA7IGsrKykgewogICAgICAgICAgICAgICAgaW50IHRvdGFsX2VnZ3MgPSBpICogc24gKyBqICogbW4gKyBrICogbG47CiAgICAgICAgICAgICAgICBpZiAodG90YWxfZWdncyA+PSBuKSB7CiAgICAgICAgICAgICAgICAgICAgaW50IGNvc3QgPSBpICogcyArIGogKiBtICsgayAqIGw7CiAgICAgICAgICAgICAgICAgICAgc3VtID0gbWluKHN1bSwgY29zdCk7CiAgICAgICAgICAgICAgICB9CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICB9CgogICAgcHJpbnRmKCIlZCIsIHN1bSk7CiAgICByZXR1cm4gMDsKfQ==