#include <iostream>
#include <bits/stdc++.h>
#define Kirlos ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define ll long long
#define pb(k) push_back(k)
#define fi first
#define se second
#define endl '\n'
#define mp(x,y) make_pair(x,y)
#define MOD 1000000007
#define all(x) x.begin(), x.end()
#define PI acos(-1)
#define sin(x) sin((x)*PI/180)
#define cos(x) cos((x)*PI/180)
#define tan(x) tan((x)*PI/180)
#define Ones(x) __builtin_popcountll(x)
 
using namespace std;
 
void solve()
{
    int n;
    cin>>n;
    vector<int>vec(n+1);
    for(int i=1; i<n+1; i++)
    {
        cin>>vec[i];
    }
    vector<int>pre(n+1);
    for(int i=1; i<=n; i++)
    {
        pre[i]=pre[i-1]+vec[i];
    }
    int q;
    cin>>q;
    while(q--)
    {
        int l,r;
        cin>>l>>r;
        l++,r++;
        cout<<pre[r]-pre[l-1]<<endl;
    }
}
 
int main()
{
    Kirlos
    ll t;
    t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}