Problem: 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}, ..., 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).

Input

The first line contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of points.

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

Output

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.

Examples

Input

6
3 5 4 7 10 12


Output

3
7 3 5

Input

5
-1 2 5 8 11


Output

1
8

Note

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.

Solution (in JAVA):

Solution:
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;

public class Main {
	public static void main(String args[]) {
		Scanner io = new Scanner(System.in);
		
		int items = io.nextInt();
		ArrayList<Long> arr = new ArrayList<Long>();
		
		int size = items;
		
		if (items == 1) {
			System.out.println(1);
			System.out.println(io.nextInt());
			return;
		}
		
		while(items-- > 0)
			arr.add(io.nextLong());
		
		
		Collections.sort(arr);
		HashSet<Long> hs = new HashSet<Long>(arr);
		
		long lb = arr.get(0);
		long ub = arr.get(size - 1);
		
		boolean found2 = false;
		boolean found3 = false;
		long ans = 0, pow2 = 0;
		
		for (long x : arr) {
			// assume x is middle element
			
			// check all elements min(x - lb, ub - x) < y < x for powers of 2
			long lim = Math.max(x-lb, ub-x);
			
			for (long i = 1; i <= lim; i*=2) {
				if (found3)
					break;

				if (hs.contains(x - i)) {
					found2 = true;
					if (hs.contains(x + i))
						found3 = true;
					
					ans = x;
					pow2 = i;
				}
			}
			
/*			for (int y: arr) {
				if (y >= x || found3)
					break;
				
				int diff = x - y;
				// if found, then check if x + that pow of 2 exists (and flip 'found2' flag)
				if (diff <= lim && (diff & (diff-1)) == 0) {
					found2 = true;
					if (hs.contains(diff + x))
						found3 = true;
					
					ans = x;
					pow2 = diff;
				}
			}
*/			
			// if it does, then print then done (flip found3)
			if (found3)
				break;
		}
		
		if(found3)
			System.out.println("3\n" + (ans-pow2) + " " + ans + " " + (ans+pow2));
		else if(found2)
			System.out.println("2\n" + (ans-pow2) + " " + ans);
		else
			System.out.println("1\n" + arr.get(0));
		
		io.close();
		
	}
}