#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int N = 1000010;
int n, cnt[N], ans, val[N];
long long a[N];
template <typename T>
void gi(T &x) {
  x = 0;
  register char c = getchar(), pre = 0;
  for (; c < '0' || c > '9'; pre = c, c = getchar())
    ;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10ll + (c ^ 48);
  if (pre == '-') x = -x;
}
int main() {
  gi(n);
  for (int i = (1); i <= (n); i++) {
    gi(a[i]);
    long long t = a[i];
    int w = 0;
    for (; t % 2 == 0; t /= 2, ++w)
      ;
    ++cnt[w], val[i] = w;
  }
  for (int i = (1); i <= (70); i++)
    if (cnt[i] > cnt[ans]) ans = i;
  printf("%d\n", n - cnt[ans]);
  for (int i = (1); i <= (n); i++)
    if (val[i] != ans) printf("%lld ", a[i]);
  return 0;
}
