Problem: Boy Dima gave Julian a birthday present — set B consisting of positive integers. However, he didn't know, that Julian hates sets, but enjoys bipartite graphs more than anything else!

Julian was almost upset, but her friend Alex said, that he can build an undirected graph using this set in such a way: let all integer numbers be vertices, then connect any two i and j with an edge if |i - j| belongs to B.

Unfortunately, Julian doesn't like the graph, that was built using B. Alex decided to rectify the situation, so he wants to erase some numbers from B, so that graph built using the new set is bipartite. The difficulty of this task is that the graph, Alex has to work with, has an infinite number of vertices and edges! It is impossible to solve this task alone, so Alex asks you for help. Write a program that erases a subset of minimum size from B so that graph constructed on the new set is bipartite.

Recall, that graph is bipartite if all its vertices can be divided into two disjoint sets such that every edge connects a vertex from different sets.

Input

First line contains an integer n ~ (1 ⩽ n ⩽ 200 000) — size of B

Second line contains n integers b_1, b_2, …, b_n ~ (1 ⩽ b_i ⩽ 10^{18}) — numbers of B, all b_i are unique

Output

In the first line print single integer k – the number of erased elements. In the second line print k integers — values of erased elements.

If there are multiple answers, print any of them.

Examples

Input


3
1 2 3


Output


1
2 

Input


2
2 6


Output


0

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long inf = (long long)1e18;
const long long MOD = (long long)(1e9 + 7);
const long long INIT = (long long)(1e6 + 100);
long long power(long long x, long long y) {
  if (y == 0) return 1;
  long long p = power(x, y / 2) % MOD;
  p = (p * p) % MOD;
  return (y % 2 == 0) ? p : (x * p) % MOD;
}
long long modInverse(long long a) { return power(a, MOD - 2); }
const long long maxn = 1e5 + 10;
long long sz[maxn];
long long parent[maxn];
void build() {
  for (long long i = 0; i < maxn; i++) sz[i] = 1, parent[i] = i;
}
long long find_set(long long a) {
  if (parent[a] == a)
    return a;
  else
    return parent[a] = find_set(parent[a]);
}
void merge(long long a, long long b) {
  a = find_set(a);
  b = find_set(b);
  if (a != b) {
    if (sz[a] > sz[b]) swap(a, b);
    parent[a] = b;
    sz[b] += sz[a];
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<pair<long long, long long>> arr;
  vector<long long> input;
  for (long long i = 0; i < n; i++) {
    long long b;
    cin >> b;
    input.push_back(b);
    long long c = 0;
    while (b % 2 == 0) {
      b /= 2;
      c++;
    }
    arr.push_back({c, i});
  }
  sort(arr.begin(), arr.end());
  long long best = 1;
  long long current_run = 1;
  long long hole = arr[0].first;
  ;
  long long bestt = arr[0].first;
  for (long long i = 1; i < n; i++) {
    if (arr[i].first != hole) {
      current_run = 1;
      hole = arr[i].first;
    } else {
      current_run++;
    }
    if (current_run > best) best = max(best, current_run), bestt = arr[i].first;
    ;
  }
  vector<long long> used_index;
  vector<long long> usunsed;
  used_index.push_back(-1);
  for (auto i : arr) {
    if (i.first == bestt) {
      used_index.push_back(i.second);
    }
  }
  used_index.push_back(n);
  for (long long i = 1; i < used_index.size(); i++) {
    for (long long k = used_index[i - 1] + 1; k < used_index[i]; k++)
      usunsed.push_back(k);
  }
  cout << usunsed.size() << "\n";
  for (auto i : usunsed) cout << input[i] << "\n";
}