import sys
from collections import Counter

def solve():

    N = int(input())
    A = list(map(int, input().split(' ')))
    
    c = Counter(A)

    # pre1[i]: 味 1~i のうち、1個以上存在する種類の数
    # pre2[i]: 味 1~i のうち、2個以上存在する種類の数
    pre1 = [0] * (N + 1)
    pre2 = [0] * (N + 1)

    for i in range(1, N + 1):
        pre1[i] = pre1[i - 1] + (1 if c[i] >= 1 else 0)
        pre2[i] = pre2[i - 1] + (1 if c[i] >= 2 else 0)

    Q = int(input())
    for i in range(Q):
        l1, r1, l2, r2 = map(int, input().split(' '))

        if (pre1[r1] - pre1[l1 - 1]) != (r1 - l1 + 1):
            print("No")
            continue

        if (pre1[r2] - pre1[l2 - 1]) != (r2 - l2 + 1):
            print("No")
            continue

        ml = max(l1, l2)
        mr = min(r1, r2)
        if ml <= mr:
            if (pre2[mr] - pre2[ml - 1]) != (mr - ml + 1):
                print("No")
                continue

        print("Yes")

if __name__ == '__main__':
    solve()