using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Security.Cryptography;
using Microsoft.VisualBasic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    static long[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var q = NN;
        var map = NArr(q);
        var asc = new FenwickTree(n);
        var desc = new FenwickTree(n);
        for (var i = 0; i + 1 < n; ++i)
        {
            if (a[i] > a[i + 1]) asc.Add(i + 1, -1);
            if (a[i] < a[i + 1]) desc.Add(i + 1, -1);
        }
        var ans = new int[q][];
        for (var i = 0; i < q; ++i)
        {
            ans[i] = new int[2];
            ans[i][0] = asc.Sum((int)map[i][1]) - asc.Sum((int)map[i][0]) == 0 ? 1 : 0;
            ans[i][1] = desc.Sum((int)map[i][1]) - desc.Sum((int)map[i][0]) == 0 ? 1 : 0;
        }
        WriteLine(string.Join("\n", ans.Select(ai => string.Join(" ", ai))));
    }
    class FenwickTree
    {
        int size;
        long[] tree;
        public FenwickTree(int size)
        {
            this.size = size;
            tree = new long[size + 2];
        }
        public void Add(int index, int value)
        {
            ++index;
            for (var x = index; x <= size; x += (x & -x)) tree[x] += value;
        }
        /// <summary>先頭からindexまでの和(include index)</summary>
        public long Sum(int index)
        {
            if (index < 0) return 0;
            ++index;
            var sum = 0L;
            for (var x = index; x > 0; x -= (x & -x)) sum += tree[x];
            return sum;
        }
        public long Get(int index)
        {
            if (index == 0) return Sum(0);
            return Sum(index) - Sum(index - 1);
        }
        /// <summary>Sum(x) >= value となる最小のxを求める</summary>
        // 各要素は非負であること
        public int LowerBound(long value)
        {
            if (value < 0) return -1;
            var x = 0;
            var b = 1;
            while (b * 2 <= size) b <<= 1;
            for (var k = b; k > 0; k >>= 1)
            {
                if (x + k <= size && tree[x + k] < value)
                {
                    value -= tree[x + k];
                    x += k;
                }
            }
            return x;
        }
    }
}