#include <bits/stdc++.h>
const int N = 2e5 + 5;
const int inf = 0x3f3f3f3f;
const double eps = 1e-5;
const int mod = 1e9 + 7;
using namespace std;
int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return f * x;
}
long long a[N], cnt[N], xx[N];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    long long x = a[i];
    int tot = 0;
    while (x % 2 == 0 && x) {
      x /= 2;
      tot++;
    }
    xx[i] = tot;
    cnt[tot]++;
  }
  long long pos = 0, maxx = 0;
  int mx = *max_element(cnt, cnt + 70);
  cout << n - mx << endl;
  for (int i = 0; i <= 70; i++) {
    if (cnt[i] == mx) {
      for (int j = 1; j <= n; j++) {
        if (xx[j] != i) cout << a[j] << " ";
      }
      return 0;
    }
  }
  putchar('\n');
  return 0;
}
