#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int n;
  cin >> n;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  vector<long long> b;
  b.push_back(a[0]);
  for (int i = 1; i < n; i++)
    if (a[i] != a[i - 1]) b.push_back(a[i]);
  vector<long long> c(b.size() - 1);
  for (int i = 1; i < b.size(); i++) c[i - 1] = b[i] - b[i - 1];
  sort(c.begin(), c.end());
  vector<long long> prf(c.size());
  int q;
  if (c.size() == 0) {
    cin >> q;
    for (int i = 0; i < q; i++) {
      long long l, r, cnt;
      cin >> l >> r;
      cnt = r - l;
      cout << cnt + 1 << " ";
    }
    return 0;
  }
  prf[0] = c[0];
  for (int i = 1; i < prf.size(); i++) prf[i] = prf[i - 1] + c[i];
  cin >> q;
  for (int i = 0; i < q; i++) {
    long long l, r, cnt;
    cin >> l >> r;
    cnt = r - l;
    int id = upper_bound(c.begin(), c.end(), cnt) - c.begin();
    long long ans = 0;
    if (id == 0)
      ans = (c.size() + 1) * (cnt + 1);
    else
      ans = prf[id - 1] + (c.size() - id + 1) * (cnt + 1);
    cout << ans << ' ';
  }
}
