#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7, n, a[500005];
vector<long long> v1[500005], vis;
long long prime_factors(long long n) {
  long long c = 0;
  while (!(n % 2)) {
    c++;
    n >>= 1;
  }
  return c;
}
int main() {
  scanf("%lld", &n);
  for (long long i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
    long long p = prime_factors(a[i]);
    v1[p].push_back(i);
  }
  long long max = 0;
  for (long long i = 0; i < 64; i++)
    if (v1[max].size() < v1[i].size()) max = i;
  vis.assign(n + 1, 0);
  for (auto it : v1[max]) vis[it] = 1;
  printf("%lld", n - v1[max].size());
  printf("\n");
  for (long long i = 0; i < n; i++)
    if (!vis[i]) cout << a[i] << " ";
}
