#include<bits/stdc++.h>

 using namespace std;

 int n,l[],r[],k;

 int main()

 {

     scanf("%d",&n);

     for(int i=;i<=n;++i) scanf("%d%d",&l[i],&r[i]);

     scanf("%d",&k);

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

     {

         if(k>=l[i] && k<=r[i]) { cout<<n-i+<<endl; break;}

     }

     return ;

  } 

 #include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 const int INF=0x3f3f3f3f;

 int n,k;

 int main()

 {

     scanf("%d%d",&n,&k);

     int a=min(k-,n-k);

     printf("%d\n",*n+a);

     return ;

  } 

 #include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 const int inf = 0x3f3f3f3f;

 const int Max = 5e2 + ;

 const int mod = 1e9 + ;

 int map1[*Max][Max],map2[*Max][Max];

 bool cmp(int index)

 {

     for (int i=; i<= map1[index][];i++)

     {

         if(map1[index][i]!=map2[index][i])

             return false;

     }

     return true;

 }

 int main()

 {

     int n, m;

     while (scanf("%d%d",&n,&m)!=EOF)

     {

         memset(map1,,sizeof(map1));

         memset(map2,,sizeof(map2));

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

         {

             for (int j=;j<=m;j++)

             {

                 int x;

                 scanf("%d", &x);

                 map1[i+j][++map1[i+j][]]=x;

             }

         }

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

         {

             for (int j=;j<=m;j++)

             {

                 int x;

                 scanf("%d", &x);

                 map2[i+j][++map2[i+j][]]=x;

             }

         }

         bool ok=true;

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

         {

             sort(map1[i]+,map1[i]++map1[i][]);

             sort(map2[i]+,map2[i]++map2[i][]);

             if(!cmp(i)){ok = false;break;}

         }

         if(ok) printf("YES\n");

         else printf("NO\n");

     }

     return ;

 }

 #include<bits/stdc++.h>

 using namespace std;

 #define PI acos(-1.0)

 #define mkp make_pair

 #define pb push_back

 #define fi first

 #define se second

 typedef pair<int,int> pii;

 typedef long long ll;

 const int INF=0x3f3f3f3f;

 const int maxn=3e5+;

 const int maxm=5e5+;

 int n,m,ans;

 int pos[maxn],num[maxn];

 vector<int> v[maxn];

 int main()

 {

     scanf("%d%d",&n,&m);

     memset(num,,sizeof(num)); ans=;

     for(int i=;i<=n;++i) scanf("%d",&pos[i]);

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

     {

         int x,y;

         scanf("%d%d",&x,&y);

         v[y].pb(x);

     }

     for(auto &i:v[pos[n]]) num[i]++;

     for(int i=n-;i>;--i)

     {

         if(num[pos[i]]>=n-ans-i) ans++;

         else {for(auto &ii:v[pos[i]]) num[ii]++;}

     }

     printf("%d\n",ans);

     return ;

  } 

 #include<bits/stdc++.h>

 #define fi first

 #define se second

 using namespace std;

 typedef long long LL;

 typedef pair<int, int> pii;

 const LL lt = -1e18;

 const int INF = 0x3f3f3f3f;

 const int MXN = 1e5 + ;

 int n, m;

 LL ar[MXN], kr[MXN], kk[MXN];

 LL sum[MXN<<],flag[MXN<<],Max[MXN<<];

 void build(int l,int r,int rt)

 {

     flag[rt]=lt;

     if(l==r)

     {

         sum[rt]=ar[l]-kr[l-];

         return;

     }

     int mid=(l+r)>>;

     build(l,mid,rt<<);build(mid+,r,rt<<|);

     sum[rt]=sum[rt<<]+sum[rt<<|];

 }

 void push_down(int l,int mid,int r,int rt)

 {

     if(flag[rt]==lt) return;

     flag[rt<<]=flag[rt];

     flag[rt<<|]=flag[rt];

     sum[rt<<]=flag[rt]*(mid-l+);

     sum[rt<<|]=flag[rt]*(r-mid);

     flag[rt]=lt;

 }

 void update(int L,int R,LL v,int l,int r,int rt)

 {

     if(L<=l&&r<=R)

     {

         flag[rt]=v;

         sum[rt]=v*(r-l+);

         return;

     }

     int mid=(l+r)>>;

     push_down(l,mid,r,rt);

     if(L>mid) update(L,R,v,mid+,r,rt<<|);

     else if(R<=mid) update(L,R,v,l,mid,rt<<);

     else update(L,mid,v,l,mid,rt<<),update(mid+,R,v,mid+,r,rt<<|);

     sum[rt]=sum[rt<<]+sum[rt<<|];

 }

 LL query(int L,int R,int l,int r,int rt)

 {

     if(L>R) return ;

     if(L<=l&&r<=R) return sum[rt];

     int mid=(l+r)>>;

     push_down(l,mid,r,rt);

     if(L>mid) return query(L,R,mid+,r,rt<<|);

     else if(R<=mid) return query(L,R,l,mid,rt<<);

     else return query(L,mid,l,mid,rt<<)+query(mid+,R,mid+,r,rt<<|);

 }

 int main()

 {

     scanf("%d", &n);

     for(int i=;i<=n;++i) scanf("%lld",&ar[i]);

     for(int i=;i<n;++i) scanf("%lld",&kr[i]);

     for(int i=;i<n;++i) kr[i]+=kr[i-];

     for(int i=;i<n;++i) kk[i]=kk[i-]+kr[i];

     build(,n,);

     int Q; scanf("%d", &Q);

     char s[]; int l, r;

     while(Q --)

     {

         scanf("%s%d%d",s,&l,&r);

         if(s[] == 's')

             printf("%lld\n",query(l,r,,n,)+kk[r-]-(l>=?kk[l-]:));

         else

         {

             int L=l,R=n,mid,ans=l;

             ar[l]=query(l,l,,n,)+r;

             while(L<=R)

             {

                 mid=L+R>>;

                 if(ar[l]>query(mid,mid,,n,)) ans=mid,L=mid+;

                 else R=mid-;

             }

             update(l,ans,ar[l],,n,);

         }

     }

     return ;

 }