K. Maratona

#include <bits/stdc++.h>
#ifdef ENABLE_DEBUG
  #define DEBUG(x) std::cout << x << std::endl
#else
  #define DEBUG(x)
#endif
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;
using ii = pair<int, int>;
using i64 = long long;
const int INF = 0x3f3f3f3f;
const i64 INFLL = 0x3f3f3f3f3f3f3f3f;

// 5, 10, 21, 42

int L = 210;

int n;
vector<int> d;
vector<tuple<int, int, int, int>> v;

i64 solve(int idx, int rem) {
  if (idx == n) return 0;

  int D = d[idx] - rem;

  auto [p, q, r, s] = v[idx];

  int restou = D % L;
  int qtd = D / L;

  int g = (L / max({ p, q, r, s }));
  i64 ans = 1LL * qtd * g;

  int passou = restou == 0 ? 0 : L - restou;

  return max(ans + (restou > 0 ? g : 0) + solve(idx + 1, passou), ans + solve(idx + 1, 0));
}

int main() {
  cin.tie(0)->sync_with_stdio(0);

  cin >> n;

  d = vector<int>(n);
  v = vector<tuple<int, int, int, int>>(n);

  for (int i = 0; i < n; ++i) {
    int p, q, r, s;
    cin >> d[i] >> p >> q >> r >> s;
    v[i] = {p, q, r, s};
  }

  cout << solve(0, 0) << '\n';
}