/**
 *    author:  orzvanh14
 *    created: 23.12.2022 10:08:02
 *    too lazy to update time
**/
// i wants to take ioi
//binhtinhtutinkhongcaycunhungmotkhikhongcontutinnualatuyetvong
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define nn "\n"
#define pi pair<int, int>
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define eb emplace_back
#define pb push_back
#define TASK " "

#define ms(a, x) memset(a, x, sizeof(a))
#define all(a) a.begin(), a.end()
#define All(a, n) a + 1, a + 1 + n

#define LOG 19


const int INF = 1e18;
const int mod = 1e9+7;
const int N = 2e5  + 5;
const int maxN = 3e5 + 5;
int MOD = 998244353;
int bit[200000];
struct node{
	int kc, u, hk;
	bool operator<(const node& other) const {
        return kc > other.kc; 
    }
};
struct edge{
	int u, v, w, id;
	friend bool operator < ( edge a, edge b){
		return a.w > b.w;
	}
};
int n,q;
int a[N];
int st[4 * N];
void nhap(){
    cin >> n;
	for(int i = 1;i <= n; i++){
		cin >> a[i];
	}
}
void build(int id, int l,int r){
	if(l == r){
		st[id] = a[l];
	}
	else{
		int m = l + r >> 1;
		build(2 * id, l, m);
		build(2 * id + 1, m + 1, r);
		st[id] = max(st[2 * id], st[2 * id + 1]);
	}
}
void update(int id, int l,int r, int i, int val){
	if(l > i || i > r){
		return;
	}
	if(l == r){
		st[id] = val;
		return;
	}
	else{
		int m = l + r >> 1;
		update(2 * id, l, m, i, val);
		update(2 * id + 1, m + 1, r, i, val);
		st[id] = max(st[2 * id], st[2 * id + 1]);
	}
}
int get(int id, int l, int r, int u, int v){
	if(l > v || r < u) return -INF;
	if(l >= u && r <= v){
		return st[id];
	}
	else{
		int m = l + r >> 1;
		return max(get(2 * id, l, m, u, v), get(2 * id + 1, m + 1, r, u, v));
	}
}
void solve(){
    int ok = 0;
	build(1, 1, n);
	for(int i = 1; i <= n; i++){
              int l, r; cin >> l >> r;
              int mx = get(1, 1, n, l, r);
              if(a[i] >= mx){
                  ok = i;
                  continue;
              }
              else{
                  a[i] = mx;
                  update(1, 1, n, i, a[i]);
                  ok = 0;
              }
          }
          cout << ok;
    
}
signed main() {
	// freopen("piggyback.in", "r", stdin);
	// freopen("piggyback.out", "w", stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
    nhap();
    solve();
	return 0;

}