#include <bits/stdc++.h>
using namespace std;
const long long inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const long double eps = 1e-6;
const int mod = 1e9 + 7;
const int maxn = 20;
const int N = 2e5 + 10;
const int M = N << 1;
template <class T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= c == '-';
  for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
  x = f ? -x : x;
}
template <class T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  T y = 1;
  int len = 1;
  for (; y <= x / 10; y *= 10) ++len;
  for (; len; --len, x %= y, y /= 10) putchar(x / y + 48);
}
long long qpow(long long a, long long b, long long MOD) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % MOD;
    b >>= 1;
    a = (a * a) % MOD;
  }
  return ans;
}
int n;
long long a[N], x;
vector<long long> v[67];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i) {
    x = a[i];
    int cnt = 0;
    while (x % 2 == 0) {
      cnt++;
      x /= 2;
    }
    v[cnt].push_back(a[i]);
  }
  int mx = -inf, pos;
  for (int i = 0; i <= 60; ++i) {
    int x = v[i].size();
    if (x > mx) {
      mx = x;
      pos = i;
    }
  }
  int ans = n - mx;
  cout << ans << endl;
  for (int i = 0; i <= 60; ++i) {
    if (i == pos) continue;
    for (auto x : v[i]) cout << x << " ";
  }
  return 0;
}
