#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  int n;
  cin >> n;
  vector<long long> b(n);
  vector<vector<long long>> two_pow(65);
  int max_pow = 0;
  for (int i = 0; i < n; i++) {
    long long num;
    cin >> num;
    b.push_back(num);
    int pow = 0;
    long long nn = num;
    while (num % 2 == 0) pow++, num /= 2;
    max_pow = max(max_pow, pow);
    for (int j = 0; j < 65; j++)
      if (j != pow) two_pow[j].push_back(nn);
  }
  int mini = INF, min_id = 0;
  for (int i = 0; i < max_pow; i++) {
    if (mini > (int)two_pow[i].size()) {
      mini = (int)two_pow[i].size();
      min_id = i;
    }
  }
  if (two_pow[min_id].size() == n) {
    cout << 0;
    return 0;
  }
  cout << two_pow[min_id].size() << '\n';
  for (auto x : two_pow[min_id]) cout << x << ' ';
  return 0;
}
