#include <cstdio>#include <cstring>#include <cmath>#include <iostream>#include <algorithm>#include <queue>#include <cstdlib>#include <vector>#include <set>#include <map>#define LL long long#define mod 1000000007#define inf 1<<30#define N 2010using namespace std;struct node{    int w,s,num;    bool operator<(const node a)const    {        return (s>a.s||(s==a.s&&w<a.w));    }}t[1010];int dp[1010],path[1010];void print(int x)//输出路径{    if(path[x]==-1)    {        printf("%d\n",x);        return;    }    print(path[x]);    printf("%d\n",x);}int main(){    int n=0;   // freopen("in.txt","r",stdin);    while(scanf("%d%d",&t[n].w,&t[n].s)!=EOF)t[n].num=n+1,n++;    sort(t,t+n);    memset(dp,0,sizeof(dp));    memset(path,-1,sizeof(path));    int mx=0,id;    for(int i=0;i<n;i++)    {        dp[i]=1;        for(int j=0;j<i;j++)        if(t[j].w<t[i].w&&dp[i]<=dp[j]+1)        {            dp[i]=dp[j]+1;            path[t[i].num]=t[j].num;        }        if(dp[i]>mx)        {            mx=dp[i];            id=t[i].num;        }    }    printf("%d\n",mx);    print(id);}