#include<cstdio>

#include<iostream>

#include<algorithm>

using namespace std;

#define N 100001

#define lowbit(x) x&-x

int m;

int c[][N*];

struct node

{

    int x,y;

}e[N];

void read(int &x)

{

    x=; char c=getchar();

    while(!isdigit(c)) c=getchar();

    while(isdigit(c)) { x=x*+c-''; c=getchar(); }

}

bool cmp(node p,node q)

{

    return p.x<q.x;

}

void add(int t,int x,int w)

{

    while(x<=m)

    {

        c[t][x]+=w;

        x+=lowbit(x);

    }

}

int query(int t,int x)

{

    int sum=;

    while(x)

    {

        sum+=c[t][x];

        x-=lowbit(x);

    }

    return sum;

}

int main()

{

    int n;

    read(n);

    for(int i=;i<=n;++i)

    {

        read(e[i].x);

        read(e[i].y);

        m=max(m,e[i].y);

    }

    for(int i=;i<=n;++i) add(,e[i].y,);

    sort(e+,e+n+,cmp);

    int j;

    int ans=n;

    int l,r,mid,tmp;

    int sum0,sum1,tot0,tot1;

    for(int i=;i<=n;i=j)

    {

        j=i;

        while(j<=n && e[j].x==e[i].x)

        {

            add(,e[j].y,-);

            add(,e[j].y,);

            j++;

        }

        l=; r=m;

        tot0=query(,m);

        tot1=query(,m);

        tmp=;

        while(l<=r)

        {

            mid=l+r>>;

            sum0=query(,mid);

            sum1=query(,mid);

            if(max(sum0,sum1)>=max(tot0-sum0,tot1-sum1))

            {

                tmp=mid;

                r=mid-;

            }

            else l=mid+;

        }

        sum0=query(,tmp);

        sum1=query(,tmp);

        ans=min(ans,max(max(sum0,sum1),max(tot0-sum0,tot1-sum1)));

    }

    cout<<ans;

}