#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<long long> a(n);
  set<int> b[80];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    int cnt = 0;
    while ((a[i] % (1LL << cnt)) == 0) cnt++;
    b[cnt].insert(i);
  }
  int mx = 0;
  int mxi = 0;
  for (int i = 0; i < 80; i++) {
    auto x = b[i];
    if (mx < x.size()) {
      mx = x.size();
      mxi = i;
    }
  }
  cout << n - mx << '\n';
  for (int i = 0; i < n; i++) {
    if (b[mxi].count(i)) {
      continue;
    }
    cout << a[i] << '\n';
  }
}
