#include <bits/stdc++.h>
using namespace std;
int xx[4] = {1, -1, 0, 0};
int yy[4] = {0, 0, 1, -1};
const double eps = 1e-9;
const int maxn = 2750131 + 50;
const long long mod = 1e9 + 7;
const int INF(0x3f3f3f3f);
const long long INFL(0x3f3f3f3f3f3f3f3fll);
inline int sign(double a) { return a < -eps ? -1 : a > eps; }
long long mul(long long a, long long b, long long c) {
  long long res = 1;
  while (b) {
    if (b & 1) res *= a, res %= c;
    a *= a, a %= c, b >>= 1;
  }
  return res;
}
long long phi(long long x) {
  long long res = x;
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) res = res / i * (i - 1);
    while (x % i == 0) x /= i;
  }
  if (x > 1) res = res / x * (x - 1);
  return res;
}
template <typename A, typename B>
inline bool chmin(A& a, B b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename A, typename B>
inline bool chmax(A& a, B b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename A, typename B>
inline long long add(A x, B y) {
  if (x + y < 0) return x + y + mod;
  return x + y >= mod ? x + y - mod : x + y;
}
template <typename A, typename B>
inline void add2(A& x, B y) {
  if (x + y < 0)
    x = x + y + mod;
  else
    x = (x + y >= mod ? x + y - mod : x + y);
}
template <typename A, typename B>
inline long long mul1(A x, B y) {
  return 1ll * x * y % mod;
}
template <typename A, typename B>
inline void mul2(A& x, B y) {
  x = (1ll * x * y % mod + mod) % mod;
}
template <typename A>
inline void debug(A a) {
  cout << a << '\n';
}
template <typename A>
inline long long sqr(A x) {
  return 1ll * x * x;
}
template <typename A>
A inv(A x) {
  return mul(x, mod - 2);
}
template <typename A>
void bugl(A a[], int l, int r) {
  for (int i = l; i <= r; i++) cout << a[i] << " ";
  cout << endl;
}
template <typename A>
void bug(A a[], int l, int r) {
  for (int i = l; i <= r; i++) cout << a[i] << " ";
  cout << endl;
}
template <class T>
void wt(const T& x) {
  cout << x << endl;
}
template <class T>
void wt(const T& x, char c) {
  cout << x << c;
}
template <class T>
void wt(const T& x, const string& s) {
  cout << x << s;
}
template <class T>
void wt(const T& x, int rnd) {
  cout << fixed << setprecision(rnd) << x << endl;
}
inline long long lowbit(long long x) { return (x & (-x)); }
inline void debug() { cout << "###!!!" << endl; }
inline long long read() {
  char c = getchar();
  long long x = 0, f = 1;
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = 1ll * x * 10 + c - '0', c = getchar();
  return x * f;
}
long long n, k;
int cnt = 0;
std::vector<int> ans;
long long a[maxn];
int vis[maxn];
vector<int> prime;
bool isprime[maxn + 200];
int heshu[maxn];
int main() {
  isprime[1] = isprime[0] = 1;
  for (int i = 2; i < maxn; i++)
    if (!isprime[i]) {
      heshu[i] = 1;
      prime.push_back(i);
      for (int j = i + i; j < maxn; j += i)
        isprime[j] = 1, heshu[j] = (heshu[j] > (j / i > i ? j / i : i)
                                        ? heshu[j]
                                        : (j / i > i ? j / i : i));
    }
  ios::sync_with_stdio(false);
  ;
  int t;
  while (cin >> n) {
    for (int i = 1; i <= n * 2; i++) cin >> a[i], vis[a[i]]++;
    sort((a + 1), (a + n * 2 + 1));
    for (int i = n * 2; i >= 1; i--) {
      if (!vis[a[i]]) continue;
      if (a[i] > 2e5) {
        int id = lower_bound((prime).begin(), (prime).end(), a[i]) -
                 prime.begin() + 1;
        vis[id]--;
        ans.push_back(id);
        vis[a[i]]--;
      } else {
        if (!isprime[a[i]]) {
          int id = lower_bound((prime).begin(), (prime).end(), a[i]) -
                   prime.begin() + 1;
          ans.push_back(id);
          vis[id]--;
          vis[a[i]]--;
        } else {
          ans.push_back(a[i]);
          vis[a[i]]--;
          vis[heshu[a[i]]]--;
        }
      }
    }
    for (auto d : ans) {
      cout << d << " ";
    }
  }
  return 0;
}
