#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

int main(){
  int n;
  cin >> n;
  vector<ll> 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;
    if (a[i] >= a[i+1]) dec[i] = 1;
  }
  rep(i,n-1) inc[i+1] += inc[i], dec[i+1] += dec[i];
  int q;
  cin >> q;
  while (q--) {
    int l, r;
    cin >> l >> r;
    l--; r--;
    int res1 = 0, res2 = 0;
    if (r - l == inc[r] - inc[l]) res1 = 1;
    if (r - l == dec[r] - dec[l]) res2 = 1;
    printf("%d %d\n", res1, res2);
  }
  return 0;
}