#include <bits/stdc++.h>
const double eps = 1e-7, PI = 3.1415926;
const int N = 5e5;
using namespace std;
long long n, m, k, x, y, fr[N], a[N], mx = -1, mn = 1e9, sum;
char c[N];
string s, s1, s2;
map<int, int> mp;
vector<long long> vec;
int main() {
  scanf("%lld", &n);
  for (int i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
    x = a[i];
    int sm = 0;
    while (x % 2 == 0) {
      sm++;
      x /= 2;
    }
    fr[sm]++;
    if (fr[sm] >= mx) {
      mx = fr[sm];
      mn = sm;
    }
  }
  for (int i = 0; i < n; i++) {
    x = a[i];
    int sm = 0;
    while (x % 2 == 0) {
      sm++;
      x /= 2;
    }
    if (sm != mn) vec.push_back(a[i]);
  }
  cout << vec.size() << endl;
  for (auto X : vec) cout << X << " ";
  return 0;
}
