#include <bits/stdc++.h>
using namespace std;
const int N = 105;
const int maxn = 2005;
struct Item {
  int t, d, p, id;
  bool operator<(const Item &other) const { return d < other.d; }
} a[N];
int dp[N][maxn], trace[N][maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d %d %d", &a[i].t, &a[i].d, &a[i].p);
    a[i].id = i;
  }
  sort(a + 1, a + n + 1);
  memset(dp, -1, sizeof(dp));
  memset(trace, -1, sizeof(trace));
  dp[0][0] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < maxn; j++) {
      if (dp[i][j] != -1) {
        if (dp[i + 1][j] < dp[i][j]) {
          dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
          trace[i + 1][j] = -1;
        }
        if (j + a[i + 1].t < a[i + 1].d &&
            dp[i + 1][j + a[i + 1].t] < dp[i][j] + a[i + 1].p) {
          dp[i + 1][j + a[i + 1].t] = dp[i][j] + a[i + 1].p;
          trace[i + 1][j + a[i + 1].t] = i + 1;
        }
      }
    }
  }
  int pos = 0;
  int ans = 0;
  vector<int> res;
  for (int i = 0; i < maxn; i++) {
    if (dp[n][i] > ans) {
      ans = dp[n][i];
      pos = i;
    }
  }
  printf("%d\n", ans);
  int cur = n;
  while (cur > 0) {
    if (trace[cur][pos] != -1) {
      res.push_back(a[trace[cur][pos]].id);
      pos = pos - a[trace[cur][pos]].t;
    }
    cur--;
  }
  printf("%d\n", (int)res.size());
  for (int i = (int)res.size() - 1; i >= 0; i--) printf("%d ", res[i]);
  return 0;
}
