#include <stdio.h>
#include <algorithm>
#include <utility>

using namespace std;

#define maxn 100010

long n, i, j, k, x, y, p1, p2, sum, sol, rez;
pair<long, long> v[maxn];

inline int cmp(const pair<long, long> &a, const pair<long, long> &b)
{
    return a.second<b.second;
}

int main()
{
    freopen("cadrane.in", "r", stdin);
    freopen("cadrane.out", "w", stdout);
    scanf("%d", &n);
    for(i=1; i<=n; i++)
    {
        scanf("%d%d", &x, &y);
        v[i]=make_pair(x, y);
    }
    sort(v+1, v+n+1, cmp);
    for(i=1; i<=n; i++)
    {
        sum=0;
        for(j=1; j<=n; j++)
            if(v[j].first>=v[i].first)
                sum++;
        p1=p2=1;
        rez=100000;
        for(j=1; j<=n; j++)
        {
            while(v[p2].second<v[j].second && p2<=n)
            {
                if(v[p2].first>v[i].first)
                    sum--;
                p2++;
            }
            while(v[p1].second<=v[j].second && p1<=n)
            {
                if(v[p1].first<v[i].first)
                    sum++;
                p1++;
            }
            rez=min(rez, sum);
        }
        sol=max(sol, rez);
    }
    printf("%d\n", sol);
    return 0;
}