import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Comparator;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Vaibhav Pulastya
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        DRecoverIt solver = new DRecoverIt();
        solver.solve(1, in, out);
        out.close();
    }

    static class DRecoverIt {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            ArrayList<Integer> primes = new ArrayList<>();
            int N = 2750131 + 5;
            int[] smallest = new int[N + 1];
            for (int i = 2; i <= N; i++) {
                if (smallest[i] == 0) {
                    primes.add(i);
                    for (int j = 2; j * i <= N; j++) {
                        if (smallest[j * i] == 0) smallest[j * i] = i;
                    }
                }
            }
            int n = in.nextInt();
            Integer[] b = in.nextIntOArray(2 * n);
            int[] c = new int[N + 1];
            Arrays.sort(b, new Comparator<Integer>() {

                public int compare(Integer o1, Integer o2) {
                    return o2 - o1;
                }
            });
            for (int i = 0; i < 2 * n; i++) {
                c[b[i]]++;
            }

            ArrayList<Integer> ans = new ArrayList<>();


            for (int i = 0; i < 2 * n; i++) {
                if (b[i] > (int) 2e5 || c[b[i]] == 0) continue;
                if (smallest[b[i]] == 0) {
                    if (c[primes.get(b[i] - 1)] > 0) {
                        ans.add(b[i]);
                        c[primes.get(b[i] - 1)]--;
                        c[b[i]]--;
                    }
                } else {
                    if (c[b[i] / smallest[b[i]]] > 0) {
                        ans.add(b[i]);
                        c[b[i] / smallest[b[i]]]--;
                        c[b[i]]--;
                    }
                }
            }


            for (int ele : ans) {
                out.print(ele + " ");
            }


        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public Integer[] nextIntOArray(int size) {
            Integer[] array = new Integer[size];
            for (int i = 0; i < size; i++)
                array[i] = nextInt();
            return array;
        }

    }
}

