#include <bits/stdc++.h>
using namespace std;
long long a[1000010];
int vis[1000010], b[1000010];
int main() {
  int n, i, mmax = 0, ans = 0, j;
  scanf("%d", &n);
  memset(vis, 0, sizeof(vis));
  for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
  if (n == 1) return puts("0"), 0;
  for (i = 1; i <= n; i++) {
    int x = 1;
    long long s = a[i];
    while (s % 2 == 0) s = s / 2, x++;
    vis[i] = x;
    b[x]++;
    mmax = max(mmax, x);
  }
  for (i = 1; i <= mmax; i++) ans = max(ans, b[i]);
  for (i = 1; i <= mmax; i++)
    if (b[i] == ans) {
      printf("%d\n", n - b[i]);
      for (j = 1; j <= n; j++)
        if (vis[j] != i) printf("%lld ", a[j]);
      break;
    }
  return 0;
}
