#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const long long Linf = 1e18 + 5;
template <class T>
inline void umax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
inline void umin(T &a, T b) {
  if (a > b) a = b;
}
template <class T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <class T>
inline T lcm(T a, T b) {
  return a * b / __gcd(a, b);
}
int read() {
  int res = 0;
  int neg;
  while (true) {
    char ch = getchar();
    if ((ch >= '0' && ch <= '9') || ch == '-') {
      if (ch == '-')
        neg = -1;
      else
        neg = 1, res = ch - '0';
      break;
    }
  }
  while (true) {
    char ch = getchar();
    if (ch >= '0' && ch <= '9')
      res *= 10, res += ch - '0';
    else
      break;
  }
  return res * neg;
}
void print(int x) {
  if (x == 0) {
    putchar('0');
    putchar('\n');
    return;
  }
  static char buf[20];
  int nn = 0;
  if (x < 0) putchar('-'), x *= -1;
  while (x) {
    buf[++nn] = x % 10 + '0';
    x /= 10;
  }
  for (int(i) = (nn); (i) >= int(1); (i)--) putchar(buf[i]);
  putchar('\n');
}
const int MAXN = 3e5 + 5;
const int MAXS = 555;
int ar[MAXN];
long long mod[MAXS];
vector<pair<int, int> > B[MAXS];
long long ans[MAXN];
int main() {
  int N = read();
  for (int(i) = (1); (i) <= int(N); (i)++) {
    ar[i] = read();
  }
  int M = read();
  for (int(i) = (1); (i) <= int(M); (i)++) {
    int a = read(), b = read();
    if (b >= MAXS) {
      long long res = 0LL;
      for (int j = a; j <= N; j += b) res += ar[j];
      ans[i] = res;
    } else {
      B[b].push_back(pair<int, int>(a, i));
    }
  }
  for (int(i) = (1); (i) < int(MAXS); (i)++)
    if (B[i].size()) {
      sort(B[i].begin(), B[i].end());
      memset(mod, 0, sizeof mod);
      int p = B[i].size() - 1;
      for (int(j) = (N); (j) >= int(1); (j)--) {
        mod[j % i] += ar[j];
        while (p >= 0 && B[i][p].first == j) {
          ans[B[i][p].second] = mod[j % i];
          p--;
        }
      }
    }
  for (int(i) = (1); (i) <= int(M); (i)++) cout << ans[i] << endl;
  return 0;
}
