/*<--- Opinion --->*/

    #define HEADER

    #define MYMATH

 // #define FILEIO

 // #define FSTREAM

 // #define FREOPEN

    #define FASTREAD

    #define SHORTNAME

 ///// HEADER FILE /////

 #ifdef HEADER

 #include <cmath>

 #include <string>

 #include <cstdio>

 #include <cstring>

 #include <cstdlib>

 #include <algorithm>

 #include <sstream>

 #include <fstream>

 #include <iostream>

 #include <set>

 #include <map>

 #include <list>

 #include <queue>

 #include <stack>

 #include <vector>

 #include <utility>

 #include <functional>

 #endif

 ///// SHORTNAME /////

 #ifdef SHORTNAME

 #define LL long long

 #define ll long long

 #define re register

 #define un unsigned

 #define rb re bool

 #define ri re int

 #define ui un int

 #define rl re LL

 #define ul un LL

 #define rep (x, y) for (ri i = x; i <= y; ++i)

 #define repi(x, y) for (ri i = x; i <= y; ++i)

 #define repj(x, y) for (ri j = x; j <= y; ++j)

 #define repk(x, y) for (ri k = x; k <= y; ++k)

 #define upto(x) for (ri i = 1; i <= x; ++i)

 #define dnto(x) for (ri i = x; i >= 1; --i)

 #define up(x) for (ri i = 1; i <= x; ++i)

 #define dn(x) for (ri i = x; i >= 1; --i)

 #define put(x)   printf("%lld ",  (LL)x)

 #define putln(x) printf("%lld\n", (LL)x)

 #endif

 ///// FASTREAD /////

 #ifdef FASTREAD

 const int FR_lim = ;

 char *FR_c;

 inline void fsetup(FILE *FR_file)

 {

     FR_c = new char[FR_lim];

     fread(FR_c, , FR_lim, FR_file);

 }

 template <class T>

 inline void fread(T &FR_num)

 {

     FR_num = ; rb FR_neg = ;

     while (*FR_c < '')

         if (*FR_c++ == '-')

             FR_neg ^= true;

     while (*FR_c >= '')

         FR_num = FR_num* + *FR_c++ - '';

     if(FR_neg)FR_num = -FR_num;

 }

 #endif

 ///// FILE I/O /////

 #ifdef FILEIO

 FILE *FIN = fopen("input.txt", "r");

 FILE *FOUT = fopen("output.txt", "w");

 #ifndef FSTREAM

 #define fin FIN

 #define fout FOUT

 #endif

 #endif

 ///// FSTREAM /////

 #ifdef FSTREAM

 std::ifstream fin("input.txt");

 std::ofstream fout("output.txt");

 #endif

 ///// MYMATH /////

 #ifdef MYMATH

 #define min(a, b) (a < b ? a : b)

 #define max(a, b) (a > b ? a : b)

 #define Min(a, b) a = min(a, b)

 #define Max(a, b) a = max(a, b)

 #define abs(x) (x < 0 ? -x : x)

 #define sqr(x) ((x)*(x))

 #endif

 ///// _MAIN_ /////

 void _main_(void);

 signed main(void)

 {

 #ifdef FREOPEN

     freopen("input.txt", "r", stdin);

     freopen("output.txt", "w", stdout);

 #endif

     _main_();

 #ifdef FILEIO

     fclose(FIN);

     fclose(FOUT);

 #endif

 #ifdef FREOPEN

     fclose(stdin);

     fclose(stdout);

 #endif

 #ifdef FSTREAM

     fin.close();

     fout.close();

 #endif

     return ;

 }

 /*<--- Main --->*/

 #define N 250005

 int n;

 int ans;

 int h[N];

 int stk[N];

 int tot = ;

 void _main_(void)

 {

     fsetup(stdin);

     fread(n);

     ri x;

     up(n)

     {

         fread(x); fread(x);

         while (tot && stk[tot] > x)--tot;

         if (tot && stk[tot] == x)++ans;

         stk[++tot] = x;

     }

     putln(n - ans);

 }

 #include <bits/stdc++.h>

 signed main(void) {

     int n, tot = ;

     scanf("%d", &n);

     std::stack<int> stk;

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

         int h; scanf("%*d%d", &h);

         while (!stk.empty() && h < stk.top())

             stk.pop();

         if (!stk.empty() && h == stk.top())

             ++tot;

         stk.push(h);

     }

     printf("%d\n", n - tot);

 }