#include <bits/stdc++.h>
using namespace std;
set<long long int> s;
long long int arr[100100], dp[100100];
vector<long long int> vi;
int main() {
  long long int n, i, j, x, y, ans, curr, temp, m, h, q, k, num, now, last,
      rose;
  scanf("%lld", &n);
  for (i = 1; i <= n; i++) {
    scanf("%lld", &curr);
    s.insert(curr);
  }
  last = -1;
  curr = 1;
  for (auto x : s) {
    if (last != -1) {
      arr[curr] = x - last;
      curr++;
    }
    last = x;
  }
  arr[curr] = 1e18 + 5;
  curr++;
  sort(arr + 1, arr + curr);
  dp[0] = 0;
  for (i = 1; i < curr; i++) {
    dp[i] = dp[i - 1] + arr[i];
  }
  scanf("%lld", &q);
  while (q--) {
    long long int l, r;
    scanf("%lld %lld", &l, &r);
    ans = r - l + 1;
    long long int low, mid, high;
    low = 1;
    high = curr;
    mid = (low + high) / 2;
    temp = mid;
    while (low <= high) {
      if (ans > arr[mid]) {
        low = mid + 1;
      } else {
        temp = mid;
        high = mid - 1;
      }
      mid = (low + high) / 2;
    }
    rose = ans * (curr - temp);
    rose += dp[temp - 1];
    vi.push_back(rose);
  }
  for (auto x : vi) {
    printf("%lld ", x);
  }
  printf("\n");
  return 0;
}
