using System;
using System.Linq;
using System.Collections.Generic;
using System.IO;

class MyClass
{
    public static void Solve()
    {
        var N = int.Parse(Console.ReadLine());
        var A = Console.ReadLine().Split().Select(long.Parse).ToArray();
        var inc = new int[N];
        var dec = new int[N];
        var left = 0;
        var count = 1;
        for (int i = 0; i < N; i++)
        {
            if (i == N - 1 || A[i] > A[i + 1])
            {
                for (int j = i; j >= left; j--)
                {
                    inc[j] = i - j + 1;
                }
                left = i + 1;
                count = 1;
            }
            else
            {
                count++;
            }
        }
        left = 0;
        count = 1;
        for (int i = 0; i < N; i++)
        {
            if (i == N - 1 || A[i] < A[i + 1])
            {
                for (int j = i; j >= left; j--)
                {
                    dec[j] = i - j + 1;
                }
                left = i + 1;
                count = 1;
            }
            else
            {
                count++;
            }
        }
        var Q = int.Parse(Console.ReadLine());
        for (int i = 0; i < Q; i++)
        {
            var input = Console.ReadLine().Split().Select(int.Parse).ToArray();
            var l = input[0];
            var r = input[1];
            var n1 = l + inc[l] > r ? 1 : 0;
            var n2 = l + dec[l] > r ? 1 : 0;
            Console.WriteLine("{0} {1}", n1, n2);
        }
    }

    public static void Main()
    {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        Console.SetOut(sw);
        Solve();
        Console.Out.Flush();
    }
}