#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n;
long long a[N], t[N];
int cs[N], gs[N], id;
int main() {
  scanf("%d", &n);
  int mx = 0;
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (int i = 1; i <= n; i++) {
    int temp = 0;
    t[i] = a[i];
    while (a[i] % 2 == 0) {
      temp++;
      a[i] /= 2;
    }
    cs[i] = temp;
    gs[temp]++;
    if (gs[temp] > mx) mx = gs[temp], id = temp;
  }
  cout << n - mx << endl;
  for (int i = 1; i <= n; i++) {
    if (cs[i] != id) {
      cout << t[i] << " ";
    }
  }
  puts("");
}
