#include<cstdio>

#include<cstring>

#include<cctype>

#include<algorithm>

using namespace std;

#define rep(i,s,t) for(int i=s;i<=t;i++)

#define dwn(i,s,t) for(int i=s;i>=t;i--)

#define clr(x,c) memset(x,c,sizeof(x))

#define ll long long

int read(){

	int x=0;char c=getchar();

	while(!isdigit(c)) c=getchar();

	while(isdigit(c)) x=x*10+c-'0',c=getchar();

	return x;

}

const int nmax=1e5+5;

const int inf=0x7f7f7f7f;

int a[nmax],l[nmax],R[nmax],q[nmax];

struct node{

	ll sm;int x;

	bool operator<(const node&rhs)const{

	  return x<rhs.x;}

};

node ns[nmax];

void solve(int x,int l,int r){

	int mid,ans=r+1,t=r;

	while(l<=r){

		mid=(l+r)>>1;

		if(ns[mid].x>=x) ans=mid,r=mid-1;

		else l=mid+1;

	}

	printf("%lld\n",ns[t].sm-ns[ans-1].sm);

}

int main(){

	int n=read();rep(i,1,n) a[i]=read();

	int r=0;

	rep(i,1,n){

		while(r&&a[q[r]]<a[i]) --r;

		l[i]=q[r]+1;q[++r]=i;

	}

	r=0;q[0]=n+1;

	dwn(i,n,1){

		while(r&&a[q[r]]<=a[i]) --r;

		R[i]=q[r]-1;q[++r]=i;

	}

	rep(i,1,n) ns[i].sm=(ll)(R[i]-i+1)*(i-l[i]+1),ns[i].x=a[i];

	sort(ns+1,ns+n+1);

	rep(i,1,n) ns[i].sm+=ns[i-1].sm;

	int t=read(),u,v,d,tmp,temp;

	while(t--) u=read(),solve(u,1,n);

	return 0;

}