#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int n, num[100], cnt[N];
long long a[N];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    long long temp = a[i];
    while (temp && temp % 2 == 0) {
      cnt[i]++;
      temp /= 2;
    }
    num[cnt[i]]++;
  }
  int id = 0;
  for (int i = 1; i <= 63; i++)
    if (num[i] > num[id]) id = i;
  cout << n - num[id] << endl;
  for (int i = 1; i <= n; i++)
    if (cnt[i] != id) cout << a[i] << ' ';
  return 0;
}
