#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 3;
const int S = 1e5 + 5;
const int inf = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  vector<long long> zz[66];
  for (int i = 0; i < n; i++) {
    long long x;
    cin >> x;
    long long xx = x;
    long long cnt = 0;
    while (x % 2 == 0) {
      cnt++;
      x /= 2;
    }
    zz[cnt].push_back(xx);
  }
  int mx = 0;
  for (int i = 0; i < 66; i++) {
    mx = max(mx, (int)zz[i].size());
  }
  int idx = -1;
  for (int i = 0; i < 66; i++) {
    if (zz[i].size() == mx) {
      idx = i;
      break;
    }
  }
  cout << n - mx << endl;
  for (int i = 0; i < 66; i++) {
    if (i == idx) continue;
    for (long long x : zz[i]) cout << x << " ";
  }
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
