#include <bits/stdc++.h>
using namespace std;
int n, cnt[200005], num[200005];
long long a[200005], b[200005];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    b[i] = a[i];
  }
  for (int i = 1; i <= n; i++) {
    while ((a[i] & 1) == 0) {
      num[i]++;
      a[i] >>= 1;
    }
    cnt[num[i]]++;
  }
  int ans = 0, k;
  for (int i = 0; i <= 60; i++) {
    if (cnt[i] > ans) ans = cnt[i], k = i;
  }
  cout << n - ans << endl;
  for (int i = 1; i <= n; i++)
    if (num[i] != k) cout << b[i] << endl;
  return 0;
}
