//#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

constexpr usize operator"" _z(unsigned long long x) noexcept {
  return static_cast<usize>(x);
}

class rep {
  const usize f, l;

public:
  class itr {
    friend rep;
    usize i;
    constexpr itr(const usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr rep(const usize first, const usize last) noexcept
      : f(first), l(last) {}
  constexpr itr begin() const noexcept { return itr(f); }
  constexpr itr end() const noexcept { return itr(l); }
};
class revrep {
  const usize f, l;

public:
  class itr {
    friend revrep;
    usize i;
    constexpr itr(usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
  constexpr itr begin() const noexcept { return itr(l); }
  constexpr itr end() const noexcept { return itr(f); }
};
template <class T> using vec_alias = std::vector<T>;
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) {
  return a < b ? b - a : a - b;
}

} // namespace n91

#include <algorithm>
#include <array>
#include <iostream>
#include <limits>
#include <numeric>
#include <set>
#include <utility>

namespace n91 {

u64 sin(u64 def, u64 a, u64 b) { return def / a * b + def % a; }

u64 dou(u64 def, u64 a1, u64 b1, u64 a2, u64 b2) {
  if (b1 * a2 < b2 * a1) {
    std::swap(a1, a2);
    std::swap(b1, b2);
  }
  u64 ret = static_cast<u64>(0);
  for (u64 i = static_cast<u64>(0); i != a1 && def >= a2 * i; ++i) {
    ret = std::max(ret, sin(def - a2 * i, a1, b1) + b2 * i);
  }
  return ret;
}

u64 tri(usize def, std::array<usize, 3_z> a, std::array<usize, 3_z> b) {
  std::vector<u64> dp(def + 1_z);
  std::iota(dp.begin(), dp.end(), static_cast<u64>(0));
  for (const auto i : rep(0_z, 3_z)) {
    const usize a1 = a[i];
    const u64 b1 = static_cast<u64>(b[i]);
    if (a1 > def + 1_z) {
      continue;
    }
    for (const auto j : rep(a1, def + 1_z)) {
      dp[j] = std::max(dp[j], dp[j - a1] + b1);
    }
  }
  return dp[def];
}

#include <cassert>

void main_() {
  usize n;
  std::array<usize, 3_z> a, b;
  std::cin >> n;
  usize cf = 0_z, cl = 0_z;

  std::cin >> a[0] >> a[1] >> a[2] >> b[0] >> b[1] >> b[2];

  for (const auto i : rep(0_z, 3_z)) {
    assert(a[i] != 0);
    assert(b[i] != 0);
    if (a[i] > b[i]) {
      ++cl;
    } else {
      ++cf;
    }
  }

  if (cf == 3_z) {
    std::cout << tri(n, a, b) << std::endl;
  } else if (cf == 2_z) {
    for (const auto i : rep(0_z, 3_z)) {
      if (a[i] > b[i]) {
        std::swap(a[0_z], a[i]);
        std::swap(b[0_z], b[i]);
      }
    }
    std::cout << sin(dou(n, a[1_z], b[1_z], a[2_z], b[2_z]), b[0_z], a[0_z])
              << std::endl;
  } else if (cf == 1_z) {
    for (const auto i : rep(0_z, 3_z)) {
      if (a[i] <= b[i]) {
        std::swap(a[0_z], a[i]);
        std::swap(b[0_z], b[i]);
      }
    }
    std::cout << dou(sin(n, a[0_z], b[0_z]), b[1_z], a[1_z], b[2_z], a[2_z])
              << std::endl;
  } else {
    for (const auto i : rep(0_z, 3_z)) {
      std::swap(a[i], b[i]);
    }
    std::cout << tri(n, a, b) << std::endl;
  }
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 256