#include <fstream>
#include <algorithm>

using namespace std;

ifstream f ("economie.in");
ofstream g ("economie.out");

int n, i, j, nr;
int v[1005], subset[1005];
bool gasit;

int main()
{
 f >> n;
  for (i=1; i<=n; i++)
     f >> v[i];

  sort(v+1, v+n+1);

  nr = 1, subset[nr] = v[nr];

   for (i=2; i<=n; i++)
   {
       gasit = true;
        for (j=1; j<=nr && gasit; j++)
            if (v[i] % subset[j] == 0)
                gasit = false;

       if (gasit == true)
        nr ++, subset[nr] = v[i];
   }

   g << nr << '\n';
    for (i=1; i<=nr; i++)
        g << subset[i] << '\n';
    return 0;
}