#include<bits/stdc++.h>

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define pii pair<int,int>

#define C 0.5772156649

#define pi acos(-1.0)

#define ll long long

#define mod 1000000007

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

using namespace std;

const double g=10.0,eps=1e-;

const int N=+,maxn=+,inf=0x3f3f3f;

int n,m;

ll ans[N],dp[N],w[N];

struct node{

    int a,b,id;

}c[N];

bool comp(node x,node y)

{

    if(x.b!=y.b)return x.b<y.b;

    return x.a<y.a;

}

int main()

{

    scanf("%d",&n);

    for(int i=;i<=n;i++)scanf("%I64d",&w[i]);

    scanf("%d",&m);

    for(int i=;i<=m;i++)

    {

        scanf("%d%d",&c[i].a,&c[i].b);

        c[i].id=i;

    }

    sort(c+,c+m+,comp);

    int nb=;

    for(int i=;i<=m;i++)

    {

        if(c[i].b>sqrt(0.5+n))

        {

            for(int j=c[i].a;j<=n;j+=c[i].b)

                ans[c[i].id]+=w[j];

        }

        else

        {

           if(c[i].b!=nb||dp[c[i].a]==)

           {

               for(int j=n;j>=;j--)

               {

                   if(j+c[i].b<=n)dp[j]=dp[j+c[i].b]+w[j];

                   else dp[j]=w[j];

               }

           }

           ans[c[i].id]=dp[c[i].a];

           nb=c[i].b;

        }

    }

    for(int i=;i<=m;i++)

        printf("%I64d\n",ans[i]);

    return ;

}

/****************

5

3 2 4 5 6

8

4 2

3 1

3 5

3 4

3 5

5 5

4 4

5 3

****************/