??????

#include <iostream>
#include <vector>
#include <cmath>

int findClosestElement(const std::vector<int>& nums, int target) {
    if (nums.empty()) return -1;

    int left = 0;
    int right = nums.size() - 1;

    while (left + 1 < right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] == target) {
            return nums[mid];
        } else if (nums[mid] < target) {
            left = mid;
        } else {
            right = mid;
        }
    }

    // Compare the closest element between nums[left] and nums[right]
    if (std::abs(nums[left] - target) <= std::abs(nums[right] - target)) {
        return nums[left];
    } else {
        return nums[right];
    }
}

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

    std::vector<int> nums(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> nums[i];
    }

    int m;
    std::cin >> m;

    for (int i = 0; i < m; ++i) {
        int target;
        std::cin >> target;
        int closest = findClosestElement(nums, target);
        std::cout << closest << std::endl;
    }

    return 0;
}