#include <bits/stdc++.h>
using namespace std;
const int inf = 2147483647;
template <typename T>
inline T read() {
  T sum = 0, fl = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') fl = -1;
  for (; isdigit(ch); ch = getchar()) sum = (sum << 3) + (sum << 1) + ch - '0';
  return sum * fl;
}
const int maxn = 65;
int ans = 0;
long long v[200005];
vector<long long> vec[maxn];
map<long long, int> M;
void Solve() {
  int n = read<int>();
  for (int i = 0; i <= 62; ++i) M[1ll << i] = i;
  for (int i = 1; i <= n; ++i) {
    v[i] = read<long long>();
    vec[M[v[i] & -v[i]]].push_back(v[i]);
  }
  for (int i = 0; i <= 62; ++i)
    if (vec[ans].size() < vec[i].size()) ans = i;
  printf("%d\n", n - vec[ans].size());
  for (int i = 1; i <= n; ++i)
    if (M[v[i] & -v[i]] != ans) printf("%I64d\n", v[i]);
}
int main() {
  Solve();
  return 0;
}
