#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; class RMQ{ public: ll n,dat[555555]; void init(int _n){ n=1; while(n<_n)n*=2; fill(dat,dat+2*n-1,MAXL); } void update(int k,ll a){ k+=n-1;dat[k]=a; while(k>0){ k=(k-1)/2; dat[k]=min(dat[k*2+1],dat[k*2+2]); } } ll query(int a,int b){return query(a,b,0,0,n);} ll query(int a,int b,int k,int l,int r){ if(r<=a||b<=l) return MAXL; if(a<=l&&r<=b) return dat[k]; ll vl=query(a,b,k*2+1,l,(l+r)/2); ll vr=query(a,b,k*2+2,(l+r)/2,r); return min(vl,vr); } }; class RMQ2{ public: ll n,dat[555555]; void init(int _n){ n=1; while(n<_n)n*=2; fill(dat,dat+2*n-1,-MAXL); } void update(int k,ll a){ k+=n-1;dat[k]=a; while(k>0){ k=(k-1)/2; dat[k]=max(dat[k*2+1],dat[k*2+2]); } } ll query(int a,int b){return query(a,b,0,0,n);} ll query(int a,int b,int k,int l,int r){ if(r<=a||b<=l) return -MAXL; if(a<=l&&r<=b) return dat[k]; ll vl=query(a,b,k*2+1,l,(l+r)/2); ll vr=query(a,b,k*2+2,(l+r)/2,r); return max(vl,vr); } }; RMQ t; RMQ2 t2; void Main() { ll n,T; cin >> n; ll a[n]; rep(i,n) cin >> a[i]; t.init(n); t2.init(n); rep(i,n-1) { t.update(i,a[i+1]-a[i]); t2.update(i,a[i+1]-a[i]); } cin >> T; while(T--) { ll l,r; cin >> l >> r; if(l==r) { pr(1,1); continue; } ll x=t.query(l,r),y=t2.query(l,r); ll p=0,q=0; if(x<=0&&y<=0) q=1; if(x>=0&&y>=0) p=1; pr(p,q); } } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}