#include "bits/stdc++.h" using namespace std; #define int long long #define FOR(i, a, b) for(int i=(a);i<(b);i++) #define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--) #define REP(i, n) for(int i=0; i<(n); i++) #define RREP(i, n) for(int i=(n-1); i>=0; i--) #define REP1(i, n) for(int i=1; i<=(n); i++) #define RREP1(i, n) for(int i=(n); i>=1; i--) #define ALL(a) (a).begin(),(a).end() #define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end()); #define CONTAIN(a, b) find(ALL(a), (b)) != (a).end() #define out(...) printf(__VA_ARGS__) int dxy[] = {0, 1, 0, -1, 0}; void solve(); signed main() { #if DEBUG std::ifstream in("input.txt"); std::cin.rdbuf(in.rdbuf()); #endif cin.tie(0); ios::sync_with_stdio(false); solve(); return 0; } /*================================*/ #if DEBUG #define SIZE 100 #else #define SIZE 123450 #endif int N,Q; int A[SIZE], F[SIZE], G[SIZE]; void solve() { cin>>N; REP(i,N)cin>>A[i]; REP(i,N-1) { if (A[i]<=A[i+1]) F[i+1] = F[i]; else F[i+1] = F[i]+1; if (A[i]>=A[i+1]) G[i+1] = G[i]; else G[i+1] = G[i]+1; } cin>>Q; int l,r; while(Q--) { cin>>l>>r; out("%d %d\n", F[l]==F[r], G[l]==G[r]); } }