#include //ios::sync_with_stdio(false);cin.tie(0); using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair pii; typedef pair ppii; typedef pair pipi; typedef pair pll; typedef pair ppll; typedef pair plpl; typedef tuple tl; ll mod=1000000007; ll mod2=998244353; ll mod3=1000003; ll mod4=998244853; ll inf=1000000000000000000; double pi=2*acos(0); #define rep(i,m,n) for(ll i=m;i=m;i--) int dh[4]={1,-1,0,0}; int dw[4]={0,0,1,-1}; int ddh[8]={-1,-1,-1,0,0,1,1,1}; int ddw[8]={-1,0,1,-1,1,-1,0,1}; ll lmax(ll a,ll b){ if(a0){ if(k&1)ret*=now; now*=now; k/=2; } return ret; } pll bit[800010]; ll u; void bitinit(ll n){ ll y=1; rep(i,0,69){ if(y>=n){ u=y; break; } y*=2; } pll p={0,0}; fill(bit,bit+u+10,p); } void add(ll n,pll x){ ll i=n; bit[i].first+=x.first; bit[i].second+=x.second; while(i0){ ret.first+=bit[i].first; ret.second+=bit[i].second; i-=i&(-i); } return ret; } int main(){ ios::sync_with_stdio(false);cin.tie(0); ll n;cin>>n; ll a[n];rep(i,0,n)cin>>a[i]; bitinit(n); rep(i,0,n-1){ if(a[i+1]>a[i])add(i+1,{1,0}); else if(a[i+1]>q; rep(i,0,q){ ll l,r;cin>>l>>r; pll p=sum(r); pll pp=sum(l); if(p.first-pp.first+p.second-pp.second==r-l)cout<<1<<" "; else cout<<0<<" "; if(pp.first-p.first+p.second-pp.second==r-l)cout<<1<