#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
long long qp(long long a, long long n) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
template <class T>
inline bool scan(T& ret) {
  char c;
  int sgn;
  if (c = getchar(), c == EOF) return 0;
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  sgn = (c == '-') ? -1 : 1;
  ret = (c == '-') ? 0 : (c - '0');
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
  ret *= sgn;
  return 1;
}
int n;
long long x[maxn];
int a[maxn];
int c[65];
int main(int argc, char* argv[]) {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%lld", &x[i]);
    long long xt = x[i];
    int tmp = 0;
    while (xt % 2 == 0) {
      xt /= 2;
      tmp++;
    }
    a[i] = tmp;
    c[tmp]++;
  }
  int mx = 0, mxpos = -1;
  for (int i = 0; i < 65; ++i) {
    if (mx < c[i]) {
      mx = c[i];
      mxpos = i;
    }
  }
  vector<long long> res;
  for (int i = 1; i <= n; ++i) {
    if (a[i] != mxpos) {
      res.push_back(x[i]);
    }
  }
  printf("%ld\n", res.size());
  for (auto i : res) printf("%lld ", i);
  return 0;
}
