class FenwickTree:
    def __init__(self, n: int):
        self.data = [0] * (n+10)
        self.n = (n+10)

    def add(self, p: int, x: int):
        assert 0 <= p < self.n
        p += 1
        while p < len(self.data):
            self.data[p] += x
            p += p & -p

    def sum(self, p: int) -> int:
        """区間 [0, p] の和"""
        assert 0 <= p < self.n
        p += 1
        s = 0
        while p > 0:
            s += self.data[p]
            p -= p & -p
        return s

    def rangesum(self, l: int, r: int) -> int:
        """区間 [l, r] の和"""
        assert 0 <= l <= r < self.n
        s = self.sum(r)
        if l > 0:
            s -= self.sum(l-1)
        return s


def f(xs, cmp):
    ft = FenwickTree(len(xs))
    for i in range(len(xs)-1):
        ft.add(i, cmp(xs[i], xs[i+1]))

    return ft


N = int(input())
A = list(map(int, input().split()))
Q = int(input())

ascend = f(A, lambda a, b: a - b <= 0)
descend = f(A, lambda a, b: a - b >= 0)
for _ in range(Q):
    l, r = map(int, input().split())
    if l == r:
        print(1, 1)
        continue

    sz = r - l
    a = ascend.rangesum(l, r-1) == sz
    b = descend.rangesum(l, r-1) == sz
    print(int(a), int(b))