// https://omegaup.com/arena/problem/El-juego-de-la-silla
#include <algorithm>
#include <iostream>

int main( ) {
   int n;
   std::cin >> n;

   int sillas[n];
   for (int i = 0; i < n; ++i) {
      std::cin >> sillas[i];
   }
   std::sort(&sillas[0], &sillas[0] + n);

   int m;
   std::cin >> m;

   for (int i = 0; i < m; ++i) {
      int pos;
      std::cin >> pos;

      int* p = std::lower_bound(&sillas[0], &sillas[0] + n, pos);
      if (p == &sillas[0] + n) {
         std::cout << pos - *(p - 1) << "\n";
      } else if (p == &sillas[0]) {
         std::cout << *p - pos << "\n";
      } else {
         std::cout << std::min(*p - pos, pos - *(p - 1)) << "\n";
      }
   }
}