#include <bits/stdc++.h>
using namespace std;
vector<int> G[100];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<long long> v;
  for (int i = 0; i < n; i++) {
    long long x;
    cin >> x;
    v.push_back(x);
  }
  for (int i = 0; i < n; i++) {
    int p = 0;
    long long x = v[i];
    while (x % 2 == 0) {
      x /= 2;
      p++;
    }
    G[p].push_back(i);
  }
  int ans = 0, best = 0;
  for (int i = 0; i < 64; i++) {
    ans = max(ans, (int)G[i].size());
    if (ans == G[i].size()) {
      best = i;
    }
  }
  cout << n - ans << endl;
  vector<bool> mark(n, 0);
  for (int i = 0; i < (int)G[best].size(); i++) {
    mark[G[best][i]] = true;
  }
  for (int i = 0; i < n; i++) {
    if (!mark[i]) {
      cout << v[i] << " ";
    }
  }
  cout << endl;
}
