#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#define maxn 100010
#define k 350
#define LL long long
using namespace std;
int n,m,op,a1,a2,be[maxn],L[k],R[k],ans;
LL A[maxn],a3,lz[k],bk[k],s[k][k];
void solve(int x){
	if(bk[x]){
	    int sum=0;
		for(int i=L[x];i<=R[x];i++)s[x][++sum]=A[i];
		sort(s[x]+1,s[x]+1+sum);
		bk[x]=0;
	}
	int l=1,r=R[x]-L[x]+1,p=0;
	while(l<=r){
	    int mid=(l+r)>>1;
		if(a3>=s[x][mid]+lz[x])l=mid+1,p=mid;
		else r=mid-1;
	}
	ans+=p;return;
}
int main(){
    freopen("dss.in","r",stdin);
    freopen("dss.out","w",stdout);
    scanf("%d",&n);int s1=1,s2=0;
    for(int i=1;i<=n;i++){
    	if(s2==0)L[s1]=i;
		s2++;be[i]=s1;
		if(s2>=k)R[s1]=i,s1++,s2=0;
		scanf("%lld",&A[i]);
    }R[be[n]]=n;
    for(int i=1;i<=be[n];i++){
	    int sum=0;
		for(int j=L[i];j<=R[i];j++)s[i][++sum]=A[j];
		sort(s[i]+1,s[i]+1+sum);
	}
    scanf("%d",&m);
    while(m--){
    	scanf("%d%d%d%lld",&op,&a1,&a2,&a3);
    	if(op==1){
    		while(a1!=L[be[a1]]&&a1<=a2)A[a1]+=a3,bk[be[a1]]=1,a1++;
    		while(a2!=R[be[a2]]&&a1<=a2)A[a2]+=a3,bk[be[a2]]=1,a2--;
    		if(a1==L[be[a1]]&&a2==R[be[a2]])for(int i=be[a1];i<=be[a2];i++)lz[i]+=a3;
    	}
    	else{
    		ans=0;
     		while(a1!=L[be[a1]]&&a1<=a2){if(A[a1]+lz[be[a1]]<=a3)ans++;a1++;}
    		while(a2!=R[be[a2]]&&a1<=a2){if(A[a2]+lz[be[a2]]<=a3)ans++;a2--;}
    		if(a1==L[be[a1]]&&a2==R[be[a2]])for(int i=be[a1];i<=be[a2];i++)solve(i);
    		printf("%d\n",ans);
    	}
    }
    return 0;
}