#include <bits/stdc++.h>
using namespace std;
template <typename S, typename T>
ostream &operator<<(ostream &out, pair<S, T> const &p) {
  out << p.first << " " << p.second;
  return out;
}
template <typename T>
ostream &operator<<(ostream &out, vector<T> const &v) {
  long long int l = v.size();
  for (long long int i = 0; i < l - 1; i++) out << v[i] << ' ';
  if (l > 0) out << v[l - 1];
  return out;
}
template <typename T>
void trace(const char *name, T &&arg1) {
  cout << name << " : " << arg1 << "\n";
}
template <typename T, typename... Args>
void trace(const char *names, T &&arg1, Args &&...args) {
  const char *comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  trace(comma + 1, args...);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n;
  cin >> n;
  long long int arr[n];
  for (long long int i = 0; i < n; i++) cin >> arr[i];
  sort(arr, arr + n);
  map<long long int, long long int> ma;
  for (long long int i = 1; i < n; i++) {
    ma[arr[i] - arr[i - 1]]++;
  }
  long long int ind = 0;
  long long int prev;
  vector<long long int> temp;
  long long int count[ma.size()];
  for (auto &e : ma) {
    if (ind == 0) {
      count[ind] = e.second;
      e.second = e.first * e.second;
    } else {
      count[ind] = count[ind - 1] + e.second;
      e.second = e.first * e.second + prev;
    }
    prev = e.second;
    ind++;
    temp.push_back(e.first);
  }
  long long int q;
  cin >> q;
  long long int sz = ma.size();
  while (q--) {
    long long int l, r;
    cin >> l >> r;
    long long int len = r - l + 1;
    auto itr = ma.upper_bound(len);
    if (itr != ma.begin()) {
      itr--;
      auto it1 =
          lower_bound(temp.begin(), temp.end(), itr->first) - temp.begin();
      long long int left = count[sz - 1] - count[it1];
      long long int ans = itr->second + (left + 1) * len;
      cout << ans << ' ';
    } else {
      long long int ans = len * n;
      cout << ans << ' ';
    }
  }
  return 0;
}
