#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr int B = 20000000;
constexpr int M = 100010;
int freq[B + M + 10];
bool valid[B + 10];
int memo[B + 10];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VL s(n), ans(n);
  rep(i, n) cin >> s[i];
  int q;
  cin >> q;
  ll from = -1, to = -1;
  rep(i, q) {
    ll t, f;
    cin >> t >> f;
    if (to < t) {
      if (to != -1) {
        ll l = to - from;
        if (l <= B) freq[l+1]++;
        else {
          rep(i, n) ans[i] += l / s[i];
        }
      }
      from = t, to = t + f;
    } else {
      to += f;
    }
  }
  {
    ll l = to - from;
    if (l <= B) freq[l+1]++;
    else {
      rep(i, n) ans[i] += l / s[i];
    }
  }
  rep(i, B + M + 5) freq[i+1] += freq[i];
  int tot = freq[B+M+5];
  rep(i, n) if (s[i] <= B) {
    int si = s[i];
    if (!valid[si]) {
      ll res = 0;
      for (int l = si; l <= B; l += si) {
        res += tot - freq[l];
      }
      valid[si] = true;
      memo[si] = res;
    }
    ans[i] += memo[si];
  }
  for (auto x : ans) cout << x << '\n';
}