#include <algorithm>
#include <cstdio>
using namespace std;

#define INF 0x3f3f3f3f
#define DIM 100005
#define sc second
#define fs first

pair <int,int> v[DIM];
int n,nri,nrj;

void read ()
{
    int i;

    scanf ("%d",&n);
    for (i=1; i<=n; ++i)
        scanf ("%d%d",&v[i].fs,&v[i].sc);
}

void solve ()
{
    int i,j,k,nrc;

    for (i=1; i<=n; ++i)
    {
        nrj=INF;
        for (j=1; j<=n; ++j)
        {
            nrc=0;
            for (k=1; k<=n; ++k)
                if ((v[k].fs<=v[i].fs && v[k].sc<=v[j].sc) || (v[k].fs>=v[i].fs && v[k].sc>=v[j].sc))
                    ++nrc;
            nrj=min (nrj,nrc);
        }
        nri=max (nri,nrj);
    }
    printf ("%d",nri);
}

int main ()
{
    freopen ("cadrane.in","r",stdin);
    freopen ("cadrane.out","w",stdout);

    read ();
    solve ();

    return 0;
}