program Project1;
{$APPTYPE CONSOLE}
uses
  SysUtils;

var inp,outp: text;
    n,i,j,c,wsp1,wsp2,ans: longint;
    a: array[1..200000,1..2]of longint;
    b: array[1..200000]of integer;
    f: boolean;
{procedure qSort(var ar: array{[1..200000,1..2]of longint; low,high: longint);
var i,j,wsp1,wsp2,m: longint;
begin
   i:=low;
   j:=high;
   m:=ar[((i+j)div 2){,1];
   repeat
      while a[i,1]<m do inc(i);
      while a[j,1]>m do dec(j);
      if i<=j then
         begin
            wsp1:=a[i,1];
            wsp2:=a[i,2];
            a[i,1]:=a[j,1];
            a[j,1]:=wsp1;
            a[i,2]:=a[j,2];
            a[j,2]:=wsp2;
            inc(i);
            dec(j);
         end;
   until i>j;
   if low<j then qSort(ar,low,j);
   if i<high then qSort(ar,i,high);
end;}
begin
   assign(inp,'task.in');
   assign(outp,'task.out');
   reset(inp);
   rewrite(outp);
   readln(inp,n);
   for i:=1 to n do
      readln(inp,a[i,1],a[i,2]);
   for i:=1 to n do
      if a[i,1]<a[i,2]then
         begin
            c:=a[i,1];
            a[i,1]:=a[i,2];
            a[i,2]:=c;
         end;
   for i:=1 to n-1 do
      for j:=i+1 to n do
         if a[j,1]<a[i,1]then
            begin
               wsp1:=a[i,1];
               a[i,1]:=a[j,1];
               a[j,1]:=wsp1;
               wsp2:=a[i,2];
               a[i,2]:=a[j,2];
               a[j,2]:=wsp2;
            end;
   ans:=0;
   {i:=1;
   j:=2;
   while i<=n-1 do
      while j<=n do
         begin
            //j:=i+1;
            if(a[j,1]>=a[i,1])and(a[j,2]>=a[i,2])then
            begin
               inc(ans);
               f:=true;
               inc(i);
               j:=i+1;
            end
               else inc(j);

         end;}
   for i:=1 to n-1 do
      for j:=i+1 to n do
         if (a[j,2]>=a[i,2])and(b[i]<>-1)then
            begin
               inc(ans);
               b[i]:=-1;
            end;
   writeln(outp,ans);
   close(inp);
   close(outp);
end.