Alex and Julian

给定一个集合B，用集合B建一张图。令集合B中所有元素的值为顶点，对于任意顶点$i$,$j$，如果$|i-j|$属于B，则在$i$,$j$间连一条边。问最少在集合B中删去多少个元素，才能使建成的图为一张二分图。 输出删去的元素数量以及删去元素的值，如果有多重方案，任意输出一种即可。

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 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 form $ 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.

First line contains an integer $ n ~ (1 \leqslant n \leqslant 200\,000) $ — size of $ B $ Second line contains $ n $ integers $ b_1, b_2, \ldots, b_n ~ (1 \leqslant b_i \leqslant 10^{18}) $ — numbers of $ B $ , all $ b_i $ are unique

In first line print single integer $ k $ – number of erased elements. In second line print $ k $ integers – values of erased elements. If there are multiple answers, print any of them.

3
1 2 3

1
2 

2
2 6

0