#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1e9 + 7;
int64_t mod1 = 1e9 + 5;
int64_t power(int64_t a, int64_t b) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return power(((((a) % mod) * ((a) % mod)) % mod), b / 2) % mod;
  else
    return (((a) % mod) *
            (power(((((a) % mod) * ((a) % mod)) % mod), b / 2) % mod)) %
           mod;
}
inline int64_t inverse(int64_t a, int64_t md) {
  a %= md;
  if (a < 0) a += md;
  int64_t b = md, u = 0, v = 1;
  while (a) {
    int64_t t = b / a;
    b -= t * a;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  assert(b == 1);
  if (u < 0) u += md;
  return u;
}
const int64_t ce = 1e9 + 7;
int64_t fast_mod(int64_t input) { return input < ce ? input : input % ce; }
int64_t dp[101][2001];
int64_t go[101][2001][2];
int64_t n, a[101], b[101], c[101];
bool comp(tuple<int64_t, int64_t, int64_t, int64_t> t1,
          tuple<int64_t, int64_t, int64_t, int64_t> t2) {
  return (get<1>(t1)) < (get<1>(t2));
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  vector<tuple<int64_t, int64_t, int64_t, int64_t>> v;
  for (int64_t i = 1; i <= n; i++)
    cin >> a[i] >> b[i] >> c[i], v.push_back({a[i], b[i], c[i], i});
  sort(v.begin(), v.end(), comp);
  int64_t in[n + 1];
  for (int64_t i = 0; i < v.size(); i++) {
    a[i + 1] = get<0>(v[i]);
    b[i + 1] = get<1>(v[i]);
    c[i + 1] = get<2>(v[i]);
    in[i + 1] = get<3>(v[i]);
  }
  memset(dp, 0, sizeof(dp));
  for (int64_t i = 1; i <= n; i++) {
    for (int64_t j = 1; j <= 2000; j++) {
      dp[i][j] = dp[i - 1][j];
      go[i][j][0] = i - 1;
      go[i][j][1] = j;
    }
    for (int64_t j = 1; j <= 2000; j++) {
      if (j + a[i] - 1 >= b[i]) break;
      dp[i][j + a[i] - 1] = max(dp[i][j + a[i] - 1], dp[i - 1][j - 1] + c[i]);
      if (dp[i][j + a[i] - 1] == dp[i - 1][j - 1] + c[i]) {
        go[i][j + a[i] - 1][0] = i - 1;
        go[i][j + a[i] - 1][1] = j - 1;
      }
    }
  }
  int64_t ans = 0;
  for (int64_t j = 0; j <= 2000; j++) {
    ans = max(ans, dp[n][j]);
  }
  cout << ans << '\n';
  if (ans != 0) {
    int64_t in1 = -1;
    for (int64_t j = 0; j <= 2000; j++) {
      if (dp[n][j] == ans) {
        in1 = j;
        break;
      }
    }
    int64_t i = n, j = in1;
    vector<int64_t> v;
    while (1) {
      if (i <= 0) break;
      int64_t in2 = go[i][j][1];
      if (go[i][j][1] == j) {
        i--;
        continue;
      } else {
        v.push_back(in[i]);
        i--, j = in2;
      }
    }
    reverse(v.begin(), v.end());
    cout << int64_t(v.size()) << '\n';
    for (auto i : v) cout << i << " ";
  } else {
    cout << 0 << '\n';
  }
}
