#include <bits/stdc++.h>
using namespace std;
pair<int, int> tree[4 * 300020];
int lazy[4 * 300020];
pair<int, pair<int, int> > p[300020];
vector<pair<int, int> > events[300020];
vector<int> final;
void build(int node, int start, int end) {
  if (start == end) {
    tree[node] = make_pair(0, start);
    lazy[node] = 0;
    return;
  }
  int mid = (start + end) / 2;
  build(2 * node, start, mid);
  build(2 * node + 1, mid + 1, end);
  tree[node] = max(tree[2 * node], tree[2 * node + 1]);
  return;
}
void update(int node, int start, int end, int l, int r, int val) {
  if (lazy[node] != 0) {
    tree[node].first += lazy[node];
    if (start != end) {
      lazy[2 * node + 1] += lazy[node];
      lazy[2 * node] += lazy[node];
    }
    lazy[node] = 0;
  }
  if (start > end || start > r || end < l) {
    return;
  }
  if (start >= l && end <= r) {
    tree[node].first += val;
    if (start != end) {
      lazy[2 * node] += val;
      lazy[2 * node + 1] += val;
    }
    return;
  }
  int mid = (start + end) / 2;
  update(2 * node, start, mid, l, r, val);
  update(2 * node + 1, mid + 1, end, l, r, val);
  tree[node] = max(tree[2 * node], tree[2 * node + 1]);
  return;
}
int main() {
  int i, j, t1, t2, t3, t4, n, maxi = 3e5 + 10, lefter, righter, ans = 0;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d %d %d", &t1, &t2, &t3);
    p[i] = make_pair(t1, make_pair(t2, t3));
    events[t1].push_back(make_pair(1, i));
    events[t2 + 1].push_back(make_pair(-1, i));
  }
  build(1, 1, maxi);
  for (i = 1; i <= maxi; i++) {
    for (auto it : events[i]) {
      if (it.first == 1) {
        update(1, 1, maxi, p[it.second].second.first,
               p[it.second].second.second, 1);
      } else {
        update(1, 1, maxi, p[it.second].second.first,
               p[it.second].second.second, -1);
      }
    }
    if (tree[1].first > ans) {
      ans = tree[1].first;
      righter = tree[1].second;
      lefter = i;
    }
  }
  for (i = 0; i < n; i++) {
    if (p[i].first <= lefter && lefter <= p[i].second.first &&
        righter >= p[i].second.first && righter <= p[i].second.second) {
      final.push_back(i + 1);
    }
  }
  printf("%d\n", ans);
  for (auto it : final) {
    printf("%d ", it);
  }
  printf("\n");
  return 0;
}
