#include <bits/stdc++.h>
using namespace std;
const long double PI = 2 * acos(0.0);
void yes() { cout << "YES\n"; }
void no() {
  cout << "NO\n";
  cout << -1 << "\n";
  exit(0);
}
long long m(long long a) { return (a + 1000000007) % 1000000007; }
long long cel(long long x1, long long y1) {
  ;
  if ((x1 % y1) == 0) return x1 / y1;
  return x1 / y1 + 1;
}
long long power(long long a, long long b) {
  if (b == 0) return 1;
  long long d = power(a, b / 2);
  d = m(d * d);
  if (b & 1) d = m(d * a);
  return d;
}
long long freq[1000], freq1[1000];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  vector<long long> b(n);
  for (long long i = 0; i < n; i++) cin >> b[i];
  long long c = pow(2, 59);
  for (long long i = 59; i >= 0; i--) {
    for (long long j = 0; j < n; j++) {
      if ((b[j] % c) == 0) freq[i]++;
    }
    c /= 2;
  }
  freq1[59] = freq[59];
  for (long long i = 58; i >= 0; i--) {
    freq1[i] = freq[i] - freq[i + 1];
  }
  long long j = 0;
  for (long long i = 0; i <= 59; i++) {
    if (freq1[j] < freq1[i]) j = i;
  }
  vector<long long> ans;
  if (j == 59) {
    long long c1 = pow(2, j);
    for (long long i = 0; i < n; i++) {
      if ((b[i] % c1) == 0) ans.push_back(b[i]);
    }
  } else {
    long long c1 = pow(2, j);
    long long c2 = pow(2, j + 1);
    for (long long i = 0; i < n; i++) {
      if (((b[i] % c1) == 0) && ((b[i] % c2) != 0)) ans.push_back(b[i]);
    }
  }
  cout << (n - ans.size()) << "\n";
  map<long long, long long> vst;
  for (long long i = 0; i < n; i++) vst[b[i]] = 0;
  for (auto it : ans) vst[it] = 1;
  for (long long i = 0; i < n; i++) {
    if (vst[b[i]] == 0) cout << b[i] << " ";
  }
}
