#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }
int op(int l, int r) { return min(l, r); }
int e() { return INF; }
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<int>c(n);
	rep(i, n) {
		int a; cin >> a;
		a--;
		c[a]++;
	}
	segtree<int, op, e>seg(c);
	int q; cin >> q;
	while (q--) {
		int l1, r1, l2, r2; cin >> l1 >> r1 >> l2 >> r2;
		l1--, l2--;
		if (seg.prod(l1, r1) < 1) {
			cout << "No" << endl;
			continue;
		}
		if (seg.prod(l2, r2) < 1) {
			cout << "No" << endl;
			continue;
		}
		int l = max(l1, l2);
		int r = min(r1, r2);
		if (l < r) {
			if (seg.prod(l, r) < 2) {
				cout << "No" << endl;
				continue;
			}
		}
		cout << "Yes" << endl;
	}
	return 0;
}