题目描述

There are $n$ distinct points on a coordinate line, the coordinate of $i$ -th point equals to $x_i$ . Choose a subset of the given set of points such that the distance between each pair of points in a subset is an integral power of two. It is necessary to consider each pair of points, not only adjacent. Note that any subset containing one element satisfies the condition above. Among all these subsets, choose a subset with maximum possible size.

In other words, you have to choose the maximum possible number of points $x_{i_1}, x_{i_2}, \dots, x_{i_m}$ such that for each pair $x_{i_j}$ , $x_{i_k}$ it is true that $|x_{i_j} - x_{i_k}| = 2^d$ where $d$ is some non-negative integer number (not necessarily the same for each pair of points).

输入格式

The first line contains one integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ) — the number of points.

The second line contains $n$ pairwise distinct integers $x_1, x_2, \dots, x_n$ ( $-10^9 \le x_i \le 10^9$ ) — the coordinates of points.

输出格式

In the first line print $m$ — the maximum possible number of points in a subset that satisfies the conditions described above.

In the second line print $m$ integers — the coordinates of points in the subset you have chosen.

If there are multiple answers, print any of them.

样例 #1

样例输入 #1

6
3 5 4 7 10 12

样例输出 #1

3
7 3 5

样例 #2

样例输入 #2

5
-1 2 5 8 11

样例输出 #2

1
8

提示

In the first example the answer is $[7, 3, 5]$ . Note, that $|7-3|=4=2^2$ , $|7-5|=2=2^1$ and $|3-5|=2=2^1$ . You can't find a subset having more points satisfying the required property.