#include <bits/stdc++.h>
using namespace std;
const long double PI = acosl(-1.);
const double EPS = 1e-12;
void combination(long long com[][1005]) {
  com[0][0] = 1;
  int sz = 1000;
  for (int i = 1; i <= sz; i++) {
    com[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      com[i][j] = com[i - 1][j] + com[i - 1][j - 1];
      com[i][j] = com[i][j] % 1000000007;
    }
  }
}
int find_par(int cn) {}
int gcd(int u, int v) {
  if (v == 0) return u;
  return gcd(v, u % v);
}
void insert_ind(int cs, int ci, int s, int e) {
  if (s == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ci <= mid)
    insert_ind(2 * cs, ci, s, mid);
  else
    insert_ind(2 * cs + 1, ci, mid + 1, e);
}
void update_ind(int cs, int ci, int s, int e, int val) {
  if (s == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ci <= mid)
    update_ind(2 * cs, ci, s, mid, val);
  else
    update_ind(2 * cs + 1, ci, mid + 1, e, val);
}
void update_seg(int cs, int ds, int de, int s, int e, int val) {
  if (ds == s && de == e) {
    return;
  }
  int mid = (s + e) / 2;
  if (ds <= mid) update_seg(2 * cs, ds, min(mid, de), s, mid, val);
  if (de > mid) update_seg(2 * cs + 1, max(mid + 1, ds), de, mid + 1, e, val);
}
void pattern_match(char pat[], const int len, int pi[]) {
  pi[0] = 0;
  for (int i = 1; i < len; i++) {
    int st = i - 1;
    while (st >= 0 && pat[pi[st]] != pat[i]) st = pi[st] - 1;
    if (st == -1)
      pi[i] = 0;
    else
      pi[i] = pi[st] + 1;
  }
}
void pattern_match(char pat[], int pi[], char tar[], const int len1, int gi[]) {
  if (pat[0] == tar[0]) gi[0] = 1;
  for (int i = 1; i < len1; i++) {
    int st = gi[i - 1];
    while (pat[st] != tar[i]) {
      if (st == 0) {
        st = -1;
        break;
      }
      st = pi[st - 1];
    }
    if (st == -1)
      gi[i] = 0;
    else
      gi[i] = st + 1;
  }
}
struct myArray {
  int mat[10][10];
};
myArray matrix_mul(myArray mat1, myArray mat2, const int sz) {
  int tmp[sz][sz];
  memset((tmp), 0, sizeof((tmp)));
  for (int r = 0; r < sz; r++)
    for (int c = 0; c < sz; c++)
      for (int cr = 0; cr < sz; cr++)
        tmp[r][c] += mat1.mat[r][cr] * mat2.mat[c][cr];
  myArray res;
  for (int r = 0; r < sz; r++)
    for (int c = 0; c < sz; c++) res.mat[r][c] = tmp[r][c];
  return res;
}
myArray unit_matrix(const int sz) {
  myArray ma;
  memset((ma.mat), 0, sizeof((ma.mat)));
  for (int i = 0; i < sz; i++) ma.mat[i][i] = 1;
  return ma;
}
myArray matrix_expo(int p, myArray mat, const int sz) {
  if (p == 0) {
    return unit_matrix(sz);
  }
  if (p & 1) return matrix_mul(mat, matrix_expo(p - 1, mat, sz), sz);
  myArray tmp = matrix_expo(p >> 1, mat, sz);
  return matrix_mul(tmp, tmp, sz);
}
myArray mat1, mat2;
int n;
int gp, val[100005], l[100005], r[100005], c[100005], p[100005],
    res[3 * 100005], ind[100005];
vector<int> V[3 * 100005], tmp;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> val[i] >> c[i] >> l[i] >> r[i];
    V[l[i] + c[i] + r[i]].push_back(i);
  }
  int Max = 0, index = 0;
  for (int i = 1; i < 3 * 100005; i++)
    if (V[i].size()) {
      for (int j = 0; j < V[i].size(); j++) {
        int in = V[i][j];
        int cres = res[c[in] + r[in]] + val[in];
        if (cres > res[r[in]] && (res[c[in] + r[in]] || l[in] == 0)) {
          res[r[in]] = cres;
          ind[r[in]] = in;
          p[in] = ind[c[in] + r[in]];
        }
        if (r[in] == 0 && res[0] > Max) {
          Max = res[0];
          index = ind[0];
        }
      }
      for (int j = 0; j < V[i].size(); j++) {
        int in = V[i][j];
        res[r[in]] = ind[r[in]] = 0;
      }
      V[i].clear();
    }
  if (index) {
    int cnt = 0;
    while (1) {
      tmp.push_back(index);
      cnt++;
      index = p[index];
      if (index == 0) break;
    }
    cout << cnt << endl;
    for (int i = tmp.size() - 1; i >= 0; i--) cout << tmp[i] << " ";
    printf("\n");
    return 0;
  }
  cout << 0 << endl;
  return 0;
}
