#include <bits/stdc++.h>
using namespace std;
const int N = 200 * 1000 + 10;
long long a[N];
int c[1000], n, i, j;
int d(long long x) {
  int cnt = 0;
  while (x % 2LL == 0LL) {
    x /= 2LL;
    cnt++;
  }
  return cnt;
}
int main() {
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    c[d(a[i])]++;
  }
  int best = 0;
  for (j = 1; j < 1000; j++)
    if ((n - c[j]) < (n - c[best])) best = j;
  cout << n - c[best] << endl;
  for (i = 0; i < n; i++)
    if (d(a[i]) != best) cout << a[i] << " ";
  cout << endl;
  return 0;
}
