#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, q;
long long l, r;
long long a[N], s[N], d[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  a[n + 1] = 2e18;
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; i++) d[i] = a[i + 1] - a[i];
  sort(d + 1, d + 1 + n);
  for (int i = 1; i <= n; i++) s[i] = s[i - 1] + d[i];
  sort(d + 1, d + 1 + n);
  long long q;
  cin >> q;
  while (q--) {
    long long l, r;
    cin >> l >> r;
    long long len = (r - l + 1);
    long long id = lower_bound(d + 1, d + 1 + n, r - l + 1) - (d + 1);
    cout << (n - id) * len + s[id] << endl;
  }
  return 0;
}
