#include <bits/stdc++.h>
using namespace std;
mt19937_64 rang(
    chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
  uniform_int_distribution<int> uid(0, lim - 1);
  return uid(rang);
}
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
vector<int> g[N];
int a[N];
void solve() {
  long long i, j, n, k, data, m, f = 1;
  cin >> n;
  vector<long long> v(n), d(n), p(n);
  vector<int> visit(n, 0);
  for (i = 0; i < n; i++) {
    cin >> v[i] >> d[i] >> p[i];
  }
  long long drop = 0;
  vector<long long> ans;
  for (i = 0; i < n; i++) {
    if (p[i] >= 0) {
      ans.push_back(i + 1);
      long long cry = 0;
      for (j = i + 1; j < n; j++) {
        if (p[j] < 0) {
          continue;
        }
        p[j] -= (v[i] + cry);
        if (v[i] > 0) v[i]--;
        if (p[j] < 0) {
          cry += d[j];
        }
      }
    }
  }
  cout << ans.size() << "\n";
  for (auto x : ans) cout << x << " ";
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  srand(chrono::high_resolution_clock::now().time_since_epoch().count());
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
int mpow(int base, int exp) {
  base %= mod;
  int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((long long)result * base) % mod;
    base = ((long long)base * base) % mod;
    exp >>= 1;
  }
  return result;
}
void ipgraph(int n, int m) {
  int i, u, v;
  while (m--) {
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
}
void dfs(int u, int par) {
  for (int v : g[u]) {
    if (v == par) continue;
    dfs(v, u);
  }
}
