#include <bits/stdc++.h>
#pragma optimize("O3")
using namespace std;
const long long MOD = 998244353;
const long long INF = 1e9 + 7;
const int base = 2e5 + 1;
const long long MAX = 1e6;
const double EPS = 1e-9;
const double PI = acos(-1.);
const int MAXN = 5 * 1e3 + 47;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  int n;
  scanf("%d", &n);
  vector<long long> v(n), a(n, 0), cnt(65, 0);
  for (int i = (0); i < (n); ++i) scanf("%lld", &v[i]);
  int mx = 0, x = 0;
  for (int i = (0); i < (n); ++i) {
    for (int j = (0); j < (64); ++j) {
      if ((v[i] % (1LL << j)) == 0)
        a[i]++;
      else
        break;
    }
    cnt[a[i]]++;
    if (cnt[a[i]] > mx) {
      mx = cnt[a[i]];
      x = a[i];
    }
  }
  printf("%d\n", n - mx);
  for (int i = (0); i < (n); ++i) {
    if (a[i] != x) printf("%lld ", v[i]);
  }
  return 0;
}
