#include<bits/stdc++.h>
using namespace std;
struct card{
	int col,num;
}a[100005];
int n,maxi;
bool cmp(card u,card v){
	if(u.col<v.col){
		return true;
	}
	if(u.col>v.col){
		return false;
	}
	return u.num<v.num;
}
int fin(int u){
	card m;
	m.col=a[u].col;m.num=a[u].num+n-1;
	int l=u,r=n,mid;
	while(l<r){
		mid=(l+r+1)/2;
		if(cmp(m,a[mid])){
			r=mid-1;
		}
		else{
			l=mid;
		}
	}
	return l-u+1;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].col>>a[i].num;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++){
		maxi=max(maxi,fin(i));
	}
	cout<<n-maxi;
	return 0;
}