#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n; cin >> n;
  vector<long long> a(n); REP(i, n) cin >> a[i];
  vector<int> inc(n, 0), dec(n, 0);
  REP(i, n - 1) {
    if (a[i] <= a[i + 1]) inc[i + 1] = 1;
    inc[i + 1] += inc[i];
    if (a[i] >= a[i + 1]) dec[i + 1] = 1;
    dec[i + 1] += dec[i];
  }
  int q; cin >> q;
  while (q--) {
    int l, r; cin >> l >> r;
    cout << (inc[r] - inc[l] == r - l ? 1 : 0) << ' ' << (dec[r] - dec[l] == r - l ? 1 : 0) << '\n';
  }
}