# include <bits/stdc++.h>

using namespace std;

int n, q;

int a[1000005], t[4000005], tg[4000005];

inline void build (int u, int l, int r) {
	
	if (l == r) {
		
		t[u] = a[l];
		
		return ;
		
	}
	
	int mid = (l + r) >> 1;
	
	build (u << 1, l, mid), build (u << 1 | 1, mid + 1, r);
	
	t[u] = max (t[u << 1], t[u << 1 | 1]);
	
}

inline int get (int u, int l, int r, int x) {
	
	if (l == r) return l;
	
	int mid = (l + r) >> 1;
	
	return t[u << 1] > x ? get (u << 1, l, mid, x) : get (u << 1 | 1, mid + 1, r, x);
	
}

inline int query (int u, int l, int r, int L, int R, int x) {
	
	if (r < L || l > R) return -1;
	
	if (L <= l && r <= R) return t[u] > x ? get (u, l, r, x) : -1;
	
	int mid = (l + r) >> 1, res = query (u << 1, l, mid, L, R, x);
	
	return res != -1 ? res : query (u << 1 | 1, mid + 1, r, L, R, x);
	
}

inline void change (int u, int l, int r, int k, int x) {
	
	if (l == r) {
		
		t[u] = x;
		
		return ;
		
	}
	
	int mid = (l + r) >> 1;
	
	if (k <= mid) change (u << 1, l, mid, k, x);
	
	else change (u << 1 | 1, mid + 1, r, k, x);
	
	t[u] = max (t[u << 1], t[u << 1 | 1]);
	
}

signed main () {
	
	scanf ("%d", &n);
	
	for (int i = 1; i <= n; ++ i) scanf ("%d", &a[i]);
	
	build (1, 1, n);
	
	scanf ("%d", &q);
	
	for (int i = 1; i <= q; ++ i) {
		
		int l, r, v;
		
		scanf ("%d %d %d", &l, &r, &v);
		
		int nw = query (1, 1, n, l, r, v);
		
		printf ("%d\n", nw);
		
		if (nw != -1) a[nw] = v, change (1, 1, n, nw, v);
		
	}
	
	return 0;
	
}