#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T& x) {
  char c;
  bool f = 0;
  while ((c = getchar()) < '0' || '9' < c) f |= (c == '-');
  for (x = (c ^ 48); '0' <= (c = getchar()) && c <= '9';
       x = (x << 1) + (x << 3) + (c ^ 48))
    ;
  if (f) x = -x;
}
template <class T>
inline T read(const T sample) {
  T x = 0;
  char c;
  bool f = 0;
  while ((c = getchar()) < '0' || '9' < c) f |= (c == '-');
  for (x = (c ^ 48); '0' <= (c = getchar()) && c <= '9';
       x = (x << 1) + (x << 3) + (c ^ 48))
    ;
  return f ? -x : x;
}
template <class T>
void fwrit(const T x) {
  if (x < 0) return (void)(putchar('-'), fwrit(-x));
  if (x > 9) fwrit(x / 10);
  putchar(x % 10 ^ 48);
}
template <class T>
inline T Max(const T x, const T y) {
  return x > y ? x : y;
}
template <class T>
inline T Min(const T x, const T y) {
  return x < y ? x : y;
}
template <class T>
inline T fab(const T x) {
  return x > 0 ? x : -x;
}
inline int gcd(const int a, const int b) { return b ? gcd(b, a % b) : a; }
inline void getInv(int inv[], const int lim, const int MOD) {
  inv[0] = inv[1] = 1;
  for (int i = 2; i <= lim; ++i)
    inv[i] = 1ll * inv[MOD % i] * (MOD - MOD / i) % MOD;
}
inline long long mulMod(const long long a, const long long b,
                        const long long mod) {
  return ((a * b - (long long)((long double)a / mod * b + 1e-8) * mod) % mod +
          mod) %
         mod;
}
const int maxn = 1e5;
const int maxl = 1e5;
struct van {
  int v, c, l, r, s, ind;
  inline bool operator<(const van rhs) const {
    if (s == rhs.s) return ind < rhs.ind;
    return s < rhs.s;
  }
} v[maxn + 5];
int n;
inline void Init() {
  n = read(1);
  int a, b, c, d;
  for (signed i = (1), i_end_ = (n); i <= i_end_; ++i) {
    a = read(1), b = read(1), c = read(1), d = read(1);
    v[i] = van{a, b, c, d, b + c + d, i};
  }
  sort(v + 1, v + n + 1);
}
int f[maxn + 5], cnt[maxn + 5], link[maxn + 5];
map<int, int> lst[maxl + 5];
void Findpath(const int i) {
  if (link[i]) Findpath(link[i]);
  fwrit(v[i].ind), putchar(' ');
}
inline void Get_f() {
  int pre, ans = 0;
  for (signed i = (1), i_end_ = (n); i <= i_end_; ++i) {
    if (v[i].l == 0) {
      f[i] = v[i].v, cnt[i] = 1;
    } else if ((pre = lst[v[i].l][v[i].s]) != 0) {
      f[i] = f[pre] + v[i].v, cnt[i] = cnt[pre] + 1;
      link[i] = pre;
    }
    if (v[i].l + v[i].c <= maxl && f[i] > f[lst[v[i].l + v[i].c][v[i].s]])
      lst[v[i].l + v[i].c][v[i].s] = i;
    if (v[i].r == 0 && f[ans] < f[i]) ans = i;
  }
  fwrit(cnt[ans]), putchar('\n');
  if (cnt[ans]) Findpath(ans);
}
signed main() {
  Init();
  Get_f();
  return 0;
}
