#include <bits/stdc++.h>
using namespace std;
int N;
signed long long B[202020];
void solve() {
  int i, j, k, l, r, x, y;
  string s;
  cin >> N;
  signed long long G = 0;
  vector<signed long long> C[64];
  int ma = 0;
  for (i = 0; i < (N); i++) {
    cin >> B[i];
    x = 0;
    while (((B[i] >> x) & 1) == 0) x++;
    C[x].push_back(B[i]);
    if (C[x].size() > C[ma].size()) ma = x;
  }
  vector<signed long long> ret;
  for (i = 0; i < (64); i++)
    if (i != ma)
      for (auto& c : C[i]) ret.push_back(c);
  sort((ret.begin()), (ret.end()));
  cout << ret.size() << endl;
  for (auto& c : ret) cout << c << " ";
}
int main(int argc, char** argv) {
  string s;
  int i;
  if (argc == 1) ios::sync_with_stdio(false), cin.tie(0);
  for (i = 0; i < (argc - 1); i++) s += argv[i + 1], s += '\n';
  for (i = 0; i < (s.size()); i++) ungetc(s[s.size() - 1 - i], stdin);
  cout.tie(0);
  solve();
  return 0;
}
