#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int s = 0, w = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    s = (s << 3) + (s << 1) + (ch ^ 48);
    ch = getchar();
  }
  return s * w;
}
const long long mod = 998244353;
const int N = 200100;
vector<long long> G[65];
int n;
long long a[N];
int main() {
  n = read();
  int maxx = 64;
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    ;
    int cnt = 0;
    long long x = a[i];
    while (a[i] % 2 == 0) {
      a[i] /= 2;
      cnt++;
    }
    G[cnt].push_back(x);
    if (G[cnt].size() > G[maxx].size()) {
      maxx = cnt;
    }
  }
  printf("%d\n", n - G[maxx].size());
  for (int i = 0; i <= 63; i++) {
    if (i == maxx) continue;
    for (int j = 0; j < G[i].size(); j++) printf("%lld ", G[i][j]);
  }
  printf("\n");
}
