#include <bits/stdc++.h>
using namespace std;
const int Maxn = 300005;
int n, l[Maxn], v[Maxn], r[Maxn], ans, L, R;
struct worker {
  int pos, l, r, val;
  bool operator<(const worker &tmp) const {
    if (pos != tmp.pos) return pos < tmp.pos;
    return val > tmp.val;
  }
} W[Maxn];
struct Tree {
  int lt, rt, maxi, tag, pos;
} tree[4 * Maxn];
void build(int root, int lt, int rt) {
  tree[root] = (Tree){lt, rt, 0, 0, lt};
  if (lt + 1 != rt) {
    int mid = (lt + rt) >> 1;
    build(root << 1, lt, mid);
    build(root << 1 | 1, mid, rt);
  }
}
void pushdown(int root) {
  if (tree[root].tag) {
    int tmp = tree[root].tag;
    tree[root].tag = 0;
    tree[root << 1].maxi += tmp;
    tree[root << 1].tag += tmp;
    tree[root << 1 | 1].maxi += tmp;
    tree[root << 1 | 1].tag += tmp;
  }
}
void insert(int root, int lt, int rt, int val) {
  if (lt == tree[root].lt && rt == tree[root].rt)
    tree[root].maxi += val, tree[root].tag += val;
  else {
    pushdown(root);
    int mid = (tree[root].lt + tree[root].rt) >> 1;
    if (lt >= mid)
      insert(root << 1 | 1, lt, rt, val);
    else if (rt <= mid)
      insert(root << 1, lt, rt, val);
    else
      insert(root << 1, lt, mid, val), insert(root << 1 | 1, mid, rt, val);
    tree[root].maxi = max(tree[root << 1].maxi, tree[root << 1 | 1].maxi);
    tree[root].pos = tree[root << 1].maxi == tree[root].maxi
                         ? tree[root << 1].pos
                         : tree[root << 1 | 1].pos;
  }
}
int main() {
  scanf("%d", &n);
  build(1, 1, 300001);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d%d", &l[i], &v[i], &r[i]);
    W[2 * i - 1] = (worker){l[i], v[i], r[i], 1};
    W[2 * i] = (worker){v[i], v[i], r[i], -1};
  }
  sort(W + 1, W + 1 + 2 * n);
  for (int i = 1; i <= 2 * n; i++) {
    insert(1, W[i].l, W[i].r + 1, W[i].val);
    if (ans < tree[1].maxi) ans = tree[1].maxi, L = W[i].pos, R = tree[1].pos;
  }
  printf("%d\n", ans);
  for (int i = 1; i <= n; i++)
    if (l[i] <= L && L <= v[i] && v[i] <= R && R <= r[i]) printf("%d ", i);
  return 0;
}
