#include <bits/stdc++.h>
using namespace std;
const long long N = 500005;
long long t[N], a[N], mp[N];
signed main() {
  long long n, ans = 0;
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) {
    scanf("%lld", a + i);
    long long now = a[i];
    while (now % 2 == 0) {
      now /= 2;
      t[i]++;
    }
    mp[t[i]]++;
    if (mp[t[i]] > mp[ans]) ans = t[i];
  }
  printf("%lld\n", n - mp[ans]);
  for (long long i = 1; i <= n; i++) {
    if (t[i] != ans) printf("%lld ", a[i]);
  }
  return 0;
}
