#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> up(n,0), low(n,0);
  for (int i = 1; i < n; i++) {
    if (a[i-1] <= a[i]) up[i] = 1;
    if (a[i-1] >= a[i]) low[i] = 1;
  }
  rep(i,n-1) up[i+1] += up[i], low[i+1] += low[i];
  int q;
  cin >> q;
  while (q--) {
    int l, r;
    cin >> l >> r;
    vector<int> res(2,0);
    if (up[r] -  up[l] == r - l) res[0]++;
    if (low[r] - low[l] == r - l) res[1]++;
    cout << res[0] << " " << res[1] << endl; 
  }
  return 0;
}