#include <bits/stdc++.h>
using namespace std;
using namespace placeholders;
template <class T>
void mini(T &l, T r) {
  l = min(l, r);
}
template <class T>
void maxi(T &l, T r) {
  l = max(l, r);
}
template <class TH>
void _dbg(const char *sdbg, TH h) {
  cerr << sdbg << "=" << h << "\n";
}
template <class TH, class... TA>
void _dbg(const char *sdbg, TH h, TA... a) {
  while (*sdbg != ',') cerr << *sdbg++;
  cerr << "=" << h << ",";
  _dbg(sdbg + 1, a...);
}
template <class T>
ostream &operator<<(ostream &os, vector<T> v) {
  os << "[";
  for (auto vv : v) os << vv << ",";
  return os << "]";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> p) {
  return os << "(" << p.first << "," << p.second << ")";
}
const int N = 110, L = 2010;
int n;
int f[N][L];
int fl[N][L];
struct Item {
  int t, d, p, i;
} items[N];
void upd(int &x, int y, int &fl, int v) {
  if (x < y) x = y, fl = v;
}
void go(int x, int y, vector<int> &v) {
  if (x == 0) return;
  if (fl[x][y]) v.push_back(items[x].i);
  go(x - 1, y - fl[x][y] * items[x].t, v);
}
void run() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d%d", &items[i].t, &items[i].d, &items[i].p);
    items[i].i = i;
  }
  sort(items + 1, items + n + 1, [](Item a, Item b) { return a.d < b.d; });
  f[0][0] = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < L; ++j) {
      if (j + items[i + 1].t < items[i + 1].d) {
        upd(f[i + 1][j + items[i + 1].t], f[i][j] + items[i + 1].p,
            fl[i + 1][j + items[i + 1].t], 1);
      }
      upd(f[i + 1][j], f[i][j], fl[i + 1][j], 0);
    }
  }
  int who = max_element(f[n], f[n] + L) - f[n];
  printf("%d\n", f[n][who]);
  vector<int> v;
  go(n, who, v);
  reverse(v.begin(), v.end());
  printf("%d\n", (int)v.size());
  for (int i = 0; i < (int)v.size(); ++i)
    printf("%d%c", v[i], " \n"[i == (int)v.size() - 1]);
}
int main() {
  run();
  return 0;
}
