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

#define MAX 100010
#define mp make_pair
#define x first
#define y second

using namespace std;

int n, mx;
pair <int, int> c[MAX];

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

    scanf("%d", &n);

    for (int i = 1; i <= n; i++)
        scanf("%d %d", &c[i].x, &c[i].y);

    int maxGs = 0;
    for (int i = 1; i <= n; i++)
    {
        mx = n + 1;
        for (int j = 1; j <= n; j++)
        {
            int ma = 0;
            for (int k = 1; k <= n; k++)
                if ((c[k].x <= c[i].x && c[k].y <= c[j].y) || (c[k].x >= c[i].x && c[k].y >= c[j].y))
                    ma++;

            mx = min(mx, ma);
        }

        maxGs = max(maxGs, mx);
    }

    printf("%d\n", maxGs);

    fclose(stdin);
    fclose(stdout);
    return 0;
}