#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
long long a[maxn];
int b[maxn], n;
vector<long long> v[100];
int go(long long x) {
  int ans = 0;
  while (x) {
    if (x % 2) return ans;
    ans++;
    x >>= 1;
  }
  return ans;
}
void solve() {
  int res = 0;
  for (int i = 0; i < 64; i++)
    if (v[i].size() > v[res].size()) res = i;
  printf("%d\n", n - (int)v[res].size());
  for (int i = 0; i < 64; i++) {
    if (i == res) continue;
    for (auto x : v[i]) printf("%I64d ", x);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%I64d", &a[i]);
  }
  for (int i = 1; i <= n; i++) {
    v[go(a[i])].push_back(a[i]);
  }
  solve();
  return 0;
}
