#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int C = 3, A = 2000;
  ll n; cin >> n;
  array<int, C> a{};
  array<ll, C> b{};
  REP(i, C) cin >> a[i] >> b[i];
  ll ans = 0;
  REP(i, C) FOR(j, i + 1, C) {
    for (int x = 0; x < A && x * a[i] <= n; ++x) {
      for (int y = 0; y < A && x * a[i] + y * a[j] <= n; ++y) {
        chmax(ans, x * b[i] + y * b[j] + (n - x * a[i] - y * a[j]) / a[i ^ j ^ 3] * b[i ^ j ^ 3]);
      }
    }
  }
  cout << ans << '\n';
  return 0;
}