#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n, i, j;
    cin >> n;

	vector<pair<pair<int, int>, int>> a(n);
	for (i = 0; i < n; i++)
	{
		cin >> a[i].first.first >> a[i].first.second;
		a[i].second = i;
	}

	sort(a.begin(), a.end());

	vector<int> opt(n);
	opt[0] = 1;

	vector<int> last(n, -1);

	for (i = 1; i < n; i++)
	{
		int best = 0;
		for (j = i-1; j >= 0; j--)
		{
			if (a[j].first.second < a[i].first.second && opt[j] > best)
			{
				best = opt[j];
				last[i] = j;
			}
		}

		opt[i] = best + 1;
	}

	int max = 0, maxi;
	for (i = 0; i < n; i++)
	{
		if (opt[i] > max)
		{
			max = opt[i];
			maxi = i;
		}
	}

	cout << max << '\n';

	i = maxi;
	vector<int> out;
	out.reserve(max);

	while (i != -1)
	{
		out.push_back(i);
		i = last[i];
	}

	for (i = max-1; i >= 0; i--)
	{
		cout << a[out[i]].second + 1 << ' ';
	}
}