#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;
using P = pair<int, int>;

template<class Tr=int>
struct segtree{
  int N;
  Tr iden;
  vector<Tr> tree;
 
  Tr op(Tr a, Tr b){return min(a, b);}
  
  int pow2(int n){
    int ans=1;
    while(ans<n) ans*=2;
    return ans;
  }

  //aの型に注意
  void build(vector<Tr> &a){
    int n=a.size();
    N=pow2(n);
    iden=1e9;
    tree.resize(2*N, iden);
    for(int i=0; i<n; i++) tree[N+i]=a[i];
    for(int i=N-1; i>=1; i--) tree[i]=op(tree[2*i], tree[2*i+1]);
  }

  void update(int node, Tr x){  //0-indexed
    int i=node+N;
    tree[i]=op(tree[i], x); i/=2;
    while(i>0){
      tree[i]=op(tree[2*i], tree[2*i+1]); i/=2;
    }
    return;
  }

  Tr query(int s, int t){  //0-indexed
    int left=s+N, right=t+N;
    Tr ansl=iden, ansr=iden;
    while(left<=right){
      if(left%2==1){
        ansl=op(ansl, tree[left]); left++;
      }
      if(right%2==0){
        ansr=op(tree[right], ansr); right--;
      }
      left/=2, right/=2;
    }
    return op(ansl, ansr);
  }
};


int main(void){
  int n; cin >> n;
  vector<int> cnt(n+1);
  for(int i=0; i<n; i++){
    int a; cin >> a;
    cnt[a]++;
  }
  segtree seg;
  seg.build(cnt);
  int q; cin >> q;
  while(q--){
    int l1, r1, l2, r2; cin >> l1 >> r1 >> l2 >> r2;
    int x=seg.query(l1, r1);
    int y=seg.query(l2, r2);
    if(x<1||y<1){
      cout << "No" << '\n'; continue;
    }
    int l=max(l1, l2), r=min(r1, r2);
    if(l<=r){
      int z=seg.query(l, r);
      if(z<2){
        cout << "No" << '\n'; continue;
      }
    }
    cout << "Yes" << '\n';
  }
  return 0; 
}