#include <bits/stdc++.h>
using namespace std;
int power(long long int n) {
  int out = 0;
  long long int comp = 1;
  while ((n & comp) == 0) {
    n = n >> 1;
    out++;
  }
  return out;
}
int freq[64] = {0};
vector<vector<long long int>> dou(64);
void solve() {
  int n;
  int num;
  cin >> n;
  long long int arr[200000] = {0};
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    num = power(arr[i]);
    freq[num]++;
    dou[num].push_back(arr[i]);
  }
  int max = 0;
  int index;
  for (int i = 0; i < 64; i++) {
    if (freq[i] > max) {
      max = freq[i];
      index = i;
    }
  }
  printf("%d\n", n - max);
  for (int i = 0; i < 64; i++) {
    if (i != index) {
      for (int j = 0; j < dou[i].size(); j++) {
        printf("%lld ", dou[i][j]);
      }
    }
  }
  if (max != n) {
    printf("\n");
  }
}
int main() {
  long long int t = 1;
  while (t--) {
    solve();
  }
}
