#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
struct less_key {
  bool operator()(pair<unsigned long long int, unsigned long long int> p1,
                  pair<unsigned long long int, unsigned long long int> p2) {
    return p1.first < p2.first ||
           (p1.first == p2.first && p1.second < p2.second);
  }
};
struct pair_hash {
 public:
  std::size_t operator()(const std::pair<unsigned long long int,
                                         unsigned long long int> &x) const {
    return std::hash<unsigned long long int>()(x.first) ^
           std::hash<unsigned long long int>()(x.second);
  }
};
const unsigned long long int mod = 1000000007ll;
const unsigned long long int smod = 999983;
const unsigned long long int inf = mod;
const double eps = 1e-10;
const unsigned long long int MAXN = 100005;
unsigned long long int n, m;
unsigned long long int s[MAXN];
unsigned long long int d[MAXN];
unsigned long long int ps[MAXN];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout.precision(15);
  cout.setf(ios::fixed);
  cin >> n;
  for (unsigned long long int i = 1; i <= n; i++) {
    cin >> s[i];
  }
  sort(s + 1, s + n + 1);
  for (unsigned long long int i = 1; i < n; i++) {
    d[i] = s[i + 1] - s[i];
  }
  sort(d + 1, d + n);
  for (unsigned long long int i = 1; i < n; i++) {
    ps[i] = ps[i - 1] + d[i];
  }
  unsigned long long int q;
  cin >> q;
  for (unsigned long long int tt = 0; tt < q; tt++) {
    unsigned long long int l, r;
    cin >> l >> r;
    unsigned long long int len = r - l + 1;
    auto f = lower_bound(d + 1, d + n, len);
    unsigned long long int u = (d + n) - f;
    unsigned long long int v = f - (d + 1);
    unsigned long long int R = u * len + ps[v] + len;
    cout << R << endl;
  }
  return 0;
}
