#include <cstdio>

using namespace std;

typedef long long LL;

struct node

{

    LL l,r,dis;

}tree[];

LL ans,u,v,m,n,i,j;

void up(LL now)

{

    tree[now].dis=tree[now*].dis+tree[now*+].dis;

}

void read(LL &x)

{

    x=;LL f=;

    char ch=getchar();

    while(ch>''||ch<''){if(ch=='-') f=-;ch=getchar();}

    while(ch>=''&&ch<=''){x=x*+(LL)ch-;ch=getchar();}

    x=x*f;

}

void build(LL l,LL r,LL now)

{

    tree[now].l=l;tree[now].r=r;

    if(tree[now].l==tree[now].r)

    {

        read(tree[now].dis);

        return;

    }

    LL mid=(l+r)>>;

    build(l,mid,now*);

    build(mid+,r,now*+);

    up(now);

}

void query(LL now)

{

    if(tree[now].l>=u&&tree[now].r<=v)

    {

        ans+=tree[now].dis;

        return;

    }

    LL m=(tree[now].l+tree[now].r)>>;

    if(u<=m) query(now<<);

    if(v>m) query(now<<|);

}

int main()

{

    freopen("sum.in","r",stdin);

    freopen("sum.out","w",stdout);

    read(n);

    build(,n,);

    read(m);

    while(m--)

    {

        read(u);read(v);

        ans=;query();

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

    }

    fclose(stdin);

    fclose(stdout);

    return ;

}