#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int T, n, d, b[N], c[N], ans, id;
long long a[N];
int main() {
  scanf("%d", &n);
  register int i, cn;
  register long long x;
  for (i = 1; i <= n; ++i) {
    scanf("%lld", &a[i]), x = a[i], cn = 0;
    while (!(x & 1)) x >>= 1, ++cn;
    ++c[cn], b[i] = cn;
    if (c[cn] > ans) ans = c[cn], id = cn;
  }
  printf("%d\n", n - ans);
  for (i = 1; i <= n; ++i)
    if (b[i] ^ id) printf("%lld ", a[i]);
  return 0;
}
