#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

typedef long long ll;
const ll maxx=500000+1;
ll C[maxx],A,n,m;

ll lowbit(ll x)
{
    return x & -x;
}

ll query(ll pos)
{
    ll res=0;
    while(pos>0)
    {
        res+=C[pos];
        pos-=lowbit(pos);
    }
    return res;
}

ll sum(ll l,ll r)
{
    return query(r)-query(l-1);
}

void add(ll pos,ll posa)
{
    while(pos<=n)
    {
        C[pos]+=posa;
        pos+=lowbit(pos);
    }
}

int main()
{
    freopen("sum.in","r",stdin);freopen("sum.out","w",stdout);
    cin>>n;
    memset(C,0,sizeof(C));
    for(ll i=1;i<=n;i++)
    {
        cin>>A;
        add(i,A);
    }
    cin>>m;
    for(ll i=1;i<=m;i++)
    {
        ll l,r;
        cin>>l>>r;
        cout<<sum(l,r)<<endl;
    }
    return 0;
}