#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main() {
  ll n;std::cin >> n;
  vll up(n, 0), down(n, 0);
  vll a(n);
  get(a);
  ll r = 0;
  for(int i=0;i<n;i++){
    if(r<i) r++;
    while(r!=n-1&&a[r]<=a[r+1]) r++;
    up[i] = r;
  }
  r = 0;
  for(int i=0;i<n;i++){
    if(r<i) r++;
    while(r!=n-1&&a[r]>=a[r+1]) r++;
    down[i] = r;
  }
  ll q;std::cin >> q;
  re(i, q){
    ll x, y;std::cin >> x >> y;
    if(up[x]>=y) std::cout << 1 << " ";
    else std::cout << 0 << " ";

    if(down[x]>=y) std::cout << 1 << '\n';
    else std::cout << 0 << '\n';
  }
}