//2.c. tétel a tételben!!!

#include <iostream>


using namespace std;



int main()
{
     const int maxm=100;
     int ev[maxm];
     int fiz[maxm];
     int kik[maxm];

     int db;

     //cout<<"add meg a db. szamot: "<<endl;

     cin>>db;

    // cout<<"add meg a talaltok szamat es a nyeremenyeket: "<<endl;

       for(int i=0;i<db;++i)
     {

         cin>>ev[i]>>fiz[i];
     }

    //2c.

    int dbc=0;
    kik[0]=ev[0];

     for(int i=0; i<db-1; ++i)
    {

        if(ev[i+1]!=kik[0])
        {

        int j=0;
        while(j<=dbc && ev[i+1]!=kik[j])
        {
        ++j;
        }

          if(j>dbc)
        {
            kik[dbc+1]=ev[i+1];
            ++dbc;

        }
        }

    }


    cout<<dbc+1;

    return 0;
}

// 1. Evf._ZH

#include <iostream>


using namespace std;



int main()
{
     const int maxm=100;
     int minh[maxm];
     int maxh[maxm];
     int kik[maxm];

     int db;

     //cout<<"add meg a db. szamot: "<<endl;

     cin>>db;

    // cout<<"add meg a talaltok szamat es a nyeremenyeket: "<<endl;

       for(int i=0;i<db;++i)
     {

         cin>>minh[i]>>maxh[i];
     }

     int s=0;
     for(int i=0; i<db; ++i)
     if(minh[i]<0) s++;

     cout<<s<<endl;

    int index=0;
    int maximum=maxh[0]-minh[0];
    for(int i=1;i<db;++i)
    {
        if(maximum<maxh[i]-minh[i])
        {
            maximum=maxh[i]-minh[i];
            index=i;
        }


    }

    cout <<index+1<<endl;

     int kisebb;
     int i=0;
     while((i<db-1) && !(maxh[i+1]<minh[i])) ++i;

     if(i<db-1) kisebb=i+1;
     else kisebb=-1;

     cout<<kisebb+1<<endl;

     int dbd=0;
     for(int i=0; i<db; ++i)
    { if(minh[i]<0 && maxh[i]>0)
        {
        kik[dbd]=i+1;
        ++dbd;
        }
    }

    cout<<dbd<<" ";

    for(int i=0; i<dbd;++i)
    cout<<kik[i]<<" ";



    return 0;
}