#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> arr(n, 0);
  for (long long int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  map<long long int, vector<long long int>> ans;
  for (long long int i = 0; i < n; i++) {
    long long int x = arr[i], c = 0;
    while ((x % 2) == 0) {
      c++;
      x >>= 1;
    }
    ans[c].push_back(i);
  }
  long long int maxx = 0;
  long long int ind = -1;
  for (auto i : ans) {
    if (i.second.size() > maxx) {
      maxx = i.second.size();
      ind = i.first;
    }
  }
  cout << n - maxx << endl;
  for (auto i : ans) {
    if (ind == i.first) continue;
    for (auto j : i.second) cout << arr[j] << " ";
  }
  cout << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
