#include <bits/stdc++.h>
using namespace std;
const int maxn = 200020;
int n;
long long b[maxn];
int two[maxn];
int cnt[100];
inline int get2(long long x) {
  int res = 0;
  while (x % 2 == 0) {
    x /= 2;
    res++;
  }
  return res;
}
int main() {
  int ans = 0;
  int mark = 0;
  scanf("%d", &n);
  for (register int i = 1; i <= n; i++) {
    scanf("%lld", &b[i]);
    two[i] = get2(b[i]);
    ++cnt[two[i]];
    if (ans < cnt[two[i]]) {
      mark = two[i];
      ans = cnt[two[i]];
    }
  }
  printf("%d\n", n - ans);
  for (register int i = 1; i <= n; i++) {
    if (two[i] != mark) {
      printf("%lld ", b[i]);
    }
  }
  printf("\n");
  return 0;
}
