#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define ROF(i, a, b) for (int i = a; i >= b; --i)
#define NEXT(i, r, v) for (int i = h[r], v; v = e[i].v, i; i = e[i].u)
const int INF = 2e9;

inline int Max(const int &a, const int &b) { return a > b ? a : b; }
inline int Min(const int &a, const int &b) { return a > b ? b : a; }

inline int read() {
    int f = 1, x = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}
using namespace std;
const int N = 1e5 + 7;
int n;
struct jgt {
    int x, v, id;
    bool operator<(const jgt &a) const { return id < a.id; }
};
set<jgt> s;
typedef set<jgt>::iterator IT;
struct qwq {
    double t;
    int a, b;
    bool operator<(const qwq &x) const { return t > x.t; }
};
priority_queue<qwq> q;
double query(jgt a, jgt b) {
    if (a.x > b.x) swap(a, b);
    if (b.v >= a.v) return -233;
    return 1.0 * (b.x - a.x) / (a.v - b.v);
}
bool vis[N];
void upd(IT it) {
    auto p = it;
    if (p != s.begin()) {
        --p;
        double x = query(*p, *it);
        if (x > 0) q.push({x, p->id, it->id});
    }
    p = it;
    ++p;
    if (p != s.end()) {
        double x = query(*it, *p);
        if (x > 0) q.push({x, it->id, p->id});
    }
}
int main() {
    n = read();
    FOR(i, 1, n) {
        int x = read(), v = read();
        s.insert({x, v, i});
    }
    for (auto it = s.begin(); it != s.end(); ++it) {
        upd(it);
    }
    while (!q.empty()) {
        qwq r = q.top();
        q.pop();
        // printf("%d %d %lf\n", r.a, r.b, r.t);
        if (vis[r.a] || vis[r.b]) continue;
        vis[r.a] = vis[r.b] = 1;
        auto p = s.find({0, 0, r.a}), q = s.find({0, 0, r.b});
        s.erase(p);
        q = s.erase(q);
        if (q != s.end()) upd(q);
        if (q != s.begin()) --q, upd(q);
    }
    int sum = 0;
    FOR(i, 1, n) {
        if (!vis[i]) ++sum;
    }
    printf("%d\n", sum);
    FOR(i, 1, n) {
        if (!vis[i]) printf("%d ", i);
    }
    puts("");
    return 0;
}