#include <bits/stdc++.h>
using namespace std;
long long n, s[131072], q;
long long diffs[131072];
long long suffdif[131072];
vector<long long> anss;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> s[i];
  sort(s, s + n);
  for (int i = 0; i < n - 1; i++) diffs[i] = s[i + 1] - s[i];
  diffs[n - 1] = -1;
  sort(diffs, diffs + n);
  suffdif[n - 1] = diffs[n - 1];
  for (int j = n - 2; j >= 0; j--) suffdif[j] = suffdif[j + 1] + diffs[j];
  cin >> q;
  for (int j = 0; j < q; j++) {
    long long a, b;
    cin >> a >> b;
    long long currdif = b - a + 1;
    int l = 0, r = n - 1;
    int tekans = 0;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (diffs[mid] <= currdif) {
        tekans = max(tekans, mid);
        l = mid + 1;
      } else
        r = mid - 1;
    }
    long long ansL = a + s[0], ansR = b + s[n - 1];
    if (tekans == n - 1) {
      anss.push_back(ansR - ansL + 1);
    } else {
      tekans++;
      long long br = n - tekans;
      anss.push_back(ansR - ansL + 1 - suffdif[tekans] + br * currdif);
    }
  }
  for (int i = 0; i < anss.size(); i++) cout << anss[i] << " ";
  cout << endl;
  return 0;
}
