#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
const int maxn = 40005;
int n;
double x[maxn], y[maxn], r[maxn];

bool inside(int i, int j) {
    double dx = x[i]-x[j], dy = y[i]-y[j];
    return dx*dx+dy*dy <= r[j]*r[j];
}

void solve() {
    vector<pair<double, int> > pos;
    for (int i = 0; i < n; i++) {
        pos.push_back(make_pair(x[i]-r[i], i));
        pos.push_back(make_pair(x[i]+r[i], i+n));
    }
    sort(pos.begin(), pos.end());
    set<pair<double, int> > s;
    vector<int> ans;
    for (int i = 0; i < pos.size(); i++) {
        int id = pos[i].second % n;
        if (pos[i].second < n) {
            set<pair<double, int> >::iterator it = s.lower_bound(make_pair(y[id], id));
            if (it != s.end() && inside(id, it->second)) continue;
            if (it != s.begin() && inside(id, (--it)->second)) continue;
            ans.push_back(id);
            s.insert(make_pair(y[id], id));
        }
        else {
            s.erase(make_pair(y[id], id));
        }
    }
    sort(ans.begin(), ans.end());
    printf("%d\n", ans.size());
    for (int i = 0; i < ans.size(); i++) {
        printf("%d%c", ans[i]+1, (i+1) == ans.size()?'\n':' ');
    }
}

int main() {
    while (~scanf("%d", &n)) {
        for (int i = 0; i < n; i++) {
            scanf("%lf %lf %lf", &r[i], &x[i], &y[i]);
        }
        solve();
    }
    return 0;
}