#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, mx, pos;
vector<long long> cnt[67];
long long b[N];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%I64d", &b[i]);
    long long v = b[i] & (-b[i]);
    cnt[v % 67].push_back(b[i]);
  }
  mx = 0;
  pos = -1;
  for (int i = 0; i < 67; ++i) {
    if (cnt[i].size() > mx) {
      mx = cnt[i].size();
      pos = i;
    }
  }
  printf("%d\n", n - mx);
  for (int i = 0; i < 67; ++i) {
    if (i == pos || !cnt[i].size()) continue;
    int len = cnt[i].size();
    for (int j = 0; j < len; ++j) printf("%I64d ", cnt[i][j]);
  }
  puts("");
  return 0;
}
