#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  while (b ^= a ^= b ^= a %= b)
    ;
  return a;
}
const int maxn = 2e5 + 9;
const int mod = 998244353;
template <class T>
inline void sc(T &ret) {
  char c;
  ret = 0;
  while ((c = getchar()) < '0' || c > '9')
    ;
  while (c >= '0' && c <= '9') {
    ret = ret * 10 + (c - '0'), c = getchar();
  }
}
long long power(long long x, long long n) {
  long long ans = 1;
  while (n) {
    if (n & 1) ans = ans * x % mod;
    x = x * x % mod;
    n >>= 1;
  }
  return ans;
}
int l[maxn], r[maxn];
int main() {
  int n;
  while (cin >> n) {
    for (int i = 0; i < n; i++) {
      cin >> l[i] >> r[i];
    }
    int k;
    cin >> k;
    int ans = n;
    for (int i = 0; i < n; i++) {
      if (r[i] >= k) {
        break;
      }
      ans--;
    }
    cout << ans << endl;
  }
  return 0;
}
