#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <iomanip>

using namespace std;
/* *
 *
 * Too many mind, no mind.
 *
 * */
using pii = pair <int, int>;
using pdi = pair <pii, pii>;
const int maxn = 1e5 + 10;
int n; 
int a[maxn], v[maxn];
set <int> in;
struct item {
	long long da, dv;
	int i, j;
	bool operator < (const item& b) const {
		if (da * b.dv == b.da * dv) {
			if (i == b.i) return j < b.j;
			return i < b.i;
		}
		return da * b.dv < b.da * dv;
	}
};
set <item> q;
bool check(int i, int j) {
	if (i > j) swap(i, j);
	return v[i] > v[j];
}
item find(int i, int j) {
	if (i > j) swap(i, j);
	long long da = a[i] - a[j], dv = v[j] - v[i];
	return {da, dv, i, j};
}
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin >> n;
	for (int i = 0; i < n; i++) cin >> a[i] >> v[i];
	for (int i = 0; i < n; i++) in.insert(i);

	for (int i = 0; i + 1 < n; i++) {
		if (check(i, i + 1)) {
			q.insert(find(i, i + 1));
		}
	}

	while (!q.empty()) {
		item u = *q.begin(); q.erase(q.begin());
		int i = u.i, j = u.j;
		if (i > j) swap(i, j);

		if (in.count(i) && in.count(j)) {
			in.erase(i);
			in.erase(j);

			int l = -1, r = -1;

			auto it = in.lower_bound(i);

			if (it != in.begin()) {
				it--;
				l = *it;
			}
			it = in.upper_bound(j);

			if (it != in.end()) r = *it;
			if (l != -1 && r != -1 && check(l, r)){
				q.insert(find(l, r));
			}
		} 
	}

	cout << in.size() << endl;
	auto it = in.begin();
	cout << *it + 1;
	it++;
	while (it != in.end()) {
		cout << " " << *it + 1;
		it++;
	}
	return 0;
}