#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;
    
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define doublecout(a) cout<<fixed<<setprecision(15)<<a<<endl;
#define Cerr(x) cerr<<(x)<<endl
#define fi first
#define se second
#define P pair<ll,ll> 
#define m_p make_pair
#define V vector<ll> 
#define U_MAP unordered_map<ll,ll>
#define pq priority_queue<ll>
#define rpq priority_queue<ll,vector<ll>,greater<ll>>
#define p_b push_back
    
ll n,cnt,ans,a[ohara],b,c,d,tmp,tmpp,m,h,w,x,y,sum,pos,k,q;
ld doua;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};
    
//------ Believe yourself as a genius!!!!!! ------

template<class T> class Lazy_Segment_Tree_Range_Minimum_Query {
	size_t N, M;
	T ini;
	vector<T> node, lazy;
	vector<bool> lazyflag;
 
public:
	Lazy_Segment_Tree_Range_Minimum_Query(const vector<T>& ar, const T ini) : M(ar.size()), ini(ini) {
		for (N=1; N<M; N*=2);
		node.resize(2*N-1);
		lazy.resize(2*N-1,ini);
		lazyflag.resize(2*N-1,false);
		for (int i=0; i<M; i++) node[i+N-1]=ar[i];
		for (int i=N-2; i>=0; i--) node[i]=min(node[i*2+1],node[i*2+2]);
	}
 
	Lazy_Segment_Tree_Range_Minimum_Query(const size_t M, const T ini) : M(M), ini(ini) {
		for (N=1; N<M; N*=2);
		node.resize(2*N-1,ini);
		lazy.resize(2*N-1,ini);
		lazyflag.resize(2*N-1,false);
	}
 
	void eval(int K, int L, int R) {
		if (lazyflag[K]) {
			node[K]=lazy[K];
			if (R-L>1) {
				lazy[K*2+1]=lazy[K];
				lazy[K*2+2]=lazy[K];
				lazyflag[K*2+1]=lazyflag[K*2+2]=true;
			}
			lazyflag[K]=false;
		}
	}
 
	void update(int A, int B, T X, int K = 0, int L = 0, int R = -1) {
		if (R<0) R = N;
		eval(K,L,R);
		if (B<=L||R<=A) return;
		if (A<=L&&R<=B) {
			lazy[K]=X;
			lazyflag[K]=true;
			eval(K,L,R);
		}
		else {
			update(A,B,X,2*K+1,L,(L+R)/2);
			update(A,B,X,2*K+2,(L+R)/2,R);
			node[K]=min(node[2*K+1],node[2*K+2]);
		}
	}
 
	T getvar(int A, int B, int K = 0, int L = 0, int R = -1) {
		if (R<0) R=N;
		eval(K,L,R);
		if (B<=L||R<=A) return ini;
		if (A<=L&&R<=B) return node[K];
		T vl=getvar(A,B,2*K+1,L,(L+R)/2);
		T vr=getvar(A,B,2*K+2,(L+R)/2,R);
		return min(vl,vr);
	}
 
	T operator[](size_t idx) {
		return getvar(idx,idx+1);
	}
 
	T operator[](pair<size_t, size_t> p) {
		return getvar(p.fi,p.se);
	}
 
	void print() {
		cout<<"{ "<<getvar(0,1);
		for (int i=1; i<M; i++) cout<<", "<<getvar(i,i+1);
		cout<<" }"<<endl;
	}
};
    
int main(void){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>n;
    rep(i,n)cin>>a[i];
    Lazy_Segment_Tree_Range_Minimum_Query<ll> seg1(n+100,LINF);
    Lazy_Segment_Tree_Range_Minimum_Query<ll> seg2(n+100,LINF);
    rep(i,n){
        seg1.update(i,i+1,0);
        seg2.update(i,i+1,0);
    }
    rep(i,n){
        ll le=i,ri=i+1;
        if(ri==n)break;
        while(1){
            if(a[ri-1]<=a[ri])ri++;
            if(ri==n)break;
            else break;
        }
        if(le+1==ri)continue;
        seg1.update(le,ri,1);
        i=ri-1;
    }
    rep(i,n){
        ll le=i,ri=i+1;
        if(ri==n)break;
        while(1){
            if(a[ri-1]>=a[ri])ri++;
            if(ri==n)break;
            else break;
        }
        if(le+1==ri)continue;
        seg2.update(le,ri,1);
        i=ri-1;
    }
    cin>>q;
    rep(i,q){
        cin>>b>>c;
        if(b==c)Cout("1 1");
        else{
            tmp=seg1.getvar(b,c);
            tmpp=seg2.getvar(b,c);
            cout<<tmp<<" "<<tmpp<<"\n";
        }
    }
    return 0;
}