//By SiriusRen

#include <cmath>

#include <cstdio>

#include <cstring>

#include <algorithm>

using namespace std;

const int N=,inf=0x3f3f3f3f;

int n,q,l,r,a[N],block[N],up[][N],down[][N],left_up[],left_down[],right_up[],right_down[];

int main(){

    scanf("%d",&n);int Block=sqrt(n);

    for(int i=;i<=n;i++)scanf("%d",&a[i]);

    for(int i=;i<=n;i++)block[i]=(i-)/Block+;

    for(int i=;i<=block[n];i++){

        int temp_up=,temp_down=,f_up=,f_down=;

        for(int j=lower_bound(block+,block++n,i)-block;j<=n;j++){

            up[i][j]=max(up[i][j-],temp_up),down[i][j]=max(temp_down,down[i][j-]);

            if(!f_down)left_down[i]=temp_down;

            if(!f_up)left_up[i]=temp_up;

            if(a[j+]>a[j])temp_up++,temp_down=,f_down=;

            else if(a[j+]<a[j])temp_down++,temp_up=,f_up=;

            else temp_up++,temp_down++;

        }

    }

    for(int i=;i<=block[n];i++){

        int temp=lower_bound(block+,block++n,i)-block,j=upper_bound(block+,block++n,i)-block-,temp_up=,temp_down=;

        for(;block[j]==block[temp];j--){

            right_up[i]=max(right_up[i],temp_up),right_down[i]=max(right_down[i],temp_down);

            if(a[j-]>a[j])temp_up++,temp_down=-inf;

            else if(a[j-]<a[j])temp_down++,temp_up=-inf;

            else temp_up++,temp_down++;

        }

    }

    scanf("%d",&q);

    while(q--){

        scanf("%d%d",&l,&r);

        if(block[l]==block[r]){

            int ans=;

            int temp_up=,temp_down=;

            for(int j=l;j<=r;j++){

                ans=max(ans,max(temp_up,temp_down));

                if(a[j+]>a[j])temp_up++,temp_down=;

                else if(a[j+]<a[j])temp_down++,temp_up=;

                else temp_up++,temp_down++;

            }

            printf("%d\n",ans);

        }

        else{

            int L=block[l]+,ans=max(up[L][r],down[L][r]),temp_up=,temp_down=;

            int beginL=lower_bound(block+,block++n,L)-block;

            for(int j=l;j<beginL;j++){

                ans=max(ans,max(temp_up,temp_down));

                if(a[j+]>a[j])temp_up++,temp_down=;

                else if(a[j+]<a[j])temp_down++,temp_up=;

                else temp_up++,temp_down++;

            }

            if(a[beginL]>=a[beginL-]){

                int tmpx=min(right_down[L-],beginL-l),tmpy=min(r-beginL+,left_up[L]);

                ans=max(ans,tmpx+tmpy);

            }

            if(a[beginL]<=a[beginL-]){

                int tmpx=min(right_up[L-],beginL-l),tmpy=min(r-beginL+,left_down[L]);

                ans=max(ans,tmpx+tmpy);

            }

            printf("%d\n",ans);

        }

    }

}