#include <bits/stdc++.h>
using namespace std;
vector<long long int> vi[105];
map<long long int, int> mp;
long long int arr[200200];
int main() {
  int n, i, j, k, x, y, ans, temp;
  int tc;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    long long int curr;
    scanf("%lld", &curr);
    arr[i] = curr;
    temp = 0;
    while (curr % 2 == 0) {
      temp++;
      curr /= 2;
    }
    vi[temp].push_back(arr[i]);
  }
  int maxi = 0;
  int alice = 0;
  for (i = 0; i < 100; i++) {
    int sz = vi[i].size();
    if (sz > maxi) {
      maxi = sz;
      alice = i;
    }
  }
  printf("%d\n", n - maxi);
  for (auto x : vi[alice]) mp[x] = 1;
  for (i = 1; i <= n; i++) {
    if (!mp[arr[i]]) printf("%lld ", arr[i]);
  }
  printf("\n");
  return 0;
}
