import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class NumberFilter {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        // Constraint: 1 ≤ n ≤ 10
        if (n < 1 || n > 10) {
            System.out.println("Invalid input.");
            scanner.close();
            return;
        }

        ArrayList<Integer> numbers = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            numbers.add(scanner.nextInt());
        }

        int divisor = scanner.nextInt();
        if (divisor <= 0) {   // must be positive
            System.out.println("Invalid input.");
            scanner.close();
            return;
        }
        scanner.close();

        ArrayList<Integer> filteredNumbers = new ArrayList<>();
        for (int number : numbers) {
            if (number % divisor != 0) {  // keep numbers not divisible
                filteredNumbers.add(number);
            }
        }

        Collections.reverse(filteredNumbers);

        if (filteredNumbers.isEmpty()) {
            System.out.println("No numbers left");
            return;
        }

        for (int i = 0; i < filteredNumbers.size(); i++) {
            System.out.print(filteredNumbers.get(i));
            if (i < filteredNumbers.size() - 1) {
                System.out.print(" ");
            }
        }
        System.out.println();
    }
}