#include <bits/stdc++.h>
using namespace std;
long long int fast_expo(long long int x, long long int p) {
  if (p == 0)
    return 1;
  else if (p % 2 == 0) {
    long long int t = fast_expo(x, p / 2) % 1000000007;
    return (t * t) % 1000000007;
  } else
    return (x * (fast_expo(x, p - 1)) % 1000000007) % 1000000007;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0 || b == 0)
    return a + b;
  else
    return gcd(b % a, a);
}
int main() {
  long long int cnt[65]{};
  long long int n;
  cin >> n;
  long long int arr[n];
  for (long long int i = 0; i < n; ++i) {
    long long int temp;
    cin >> temp;
    arr[i] = temp;
    long long int x = 0;
    while ((temp & 1) == 0) {
      x++;
      temp >>= 1;
    }
    cnt[x]++;
  }
  long long int ans = INT_MAX, ansp = -1;
  for (long long int i = 0; i < 65; ++i) {
    if (n - cnt[i] < ans) {
      ans = n - cnt[i];
      ansp = i;
    }
  }
  cout << ans << "\n";
  for (long long int i = 0; i < n; ++i) {
    long long int temp = arr[i];
    long long int x = 0;
    while ((temp & 1) == 0) {
      x++;
      temp >>= 1;
    }
    if (x != ansp) cout << arr[i] << " ";
  }
  return 0;
}
