#include <bits/stdc++.h>

typedef long long ll;
using namespace std;

#define all(x) x.begin(), x.end()
#define f(i,a,b) for(int i = (a); i <= (b); i++)
#define pb push_back

const int BLOCK = 300;

struct Query
{
    int l,r,id;
    Query(int _l, int _r, int _id) : l(_l), r(_r), id(_id) {};
    friend bool operator < (Query q1, Query q2)
    {
        if(q1.l / BLOCK != q2.l / BLOCK) return q1.l / BLOCK < q2.l / BLOCK;
        else return q1.r < q2.r;
    }
};

int A[100005], Freq[100005], N, Q;
ll Ans[100005];
vector<Query> Queries;

int main()
{
    cin >> N;
    f(i,1,N) cin >> A[i];
    cin >> Q;
    f(q,1,Q)
    {
        int l,r;
        cin >> l >> r;
        Queries.pb(Query(l,r,q));
    }
    sort(all(Queries));
    int l = 1, r = 0;
    ll ans = 0;
    for(Query q : Queries)
    {
        while(r < q.r)
        {
            ll x = A[r+1];
            r++;
            if(Freq[x]&1)
            {
                ans -= x*Freq[x];
                Freq[x]++;
            }
            else
            {
                Freq[x]++;
                ans += x*Freq[x];
            }
        }
        while(l > q.l)
        {
            ll x = A[l-1];
            l--;
            if(Freq[x]&1)
            {
                ans -= x*Freq[x];
                Freq[x]++;
            }
            else
            {
                Freq[x]++;
                ans += x*Freq[x];
            }
        }
        while(l < q.l)
        {
            ll x = A[l];
            l++;
            if(Freq[x]&1)
            {
                ans -= x*Freq[x];
                Freq[x]--;
            }
            else
            {
                Freq[x]--;
                ans += x*Freq[x];
            }
        }
        while(r > q.r)
        {
            ll x = A[r];
            r--;
            if(Freq[x]&1)
            {
                ans -= x*Freq[x];
                Freq[x]--;
            }
            else
            {
                Freq[x]--;
                ans += x*Freq[x];
            }
        }
        Ans[q.id] = ans;
    }
    f(q,1,Q) cout << Ans[q] << "\n";
}