Arithmetic Progression

给定一个序列，问是否可以只插入一个数使得整个序列成为等差数列，求出所有可能的情况，并输出这些数。

Everybody knows what an arithmetic progression is. Let us remind you just in case that an arithmetic progression is such sequence of numbers $ a_{1},a_{2},...,a_{n} $ of length $ n $ , that the following condition fulfills: $ a_{2}-a_{1}=a_{3}-a_{2}=a_{4}-a_{3}=...=a_{i+1}-a_{i}=...=a_{n}-a_{n-1}. $ For example, sequences \[1, 5\], \[10\], \[5, 4, 3\] are arithmetic progressions and sequences \[1, 3, 2\], \[1, 2, 4\] are not. Alexander has $ n $ cards containing integers. Arthur wants to give Alexander exactly one more card with a number so that he could use the resulting $ n+1 $ cards to make an arithmetic progression (Alexander has to use all of his cards). Arthur has already bought a card but he hasn't written a number on it. Help him, print all integers that you can write on a card so that the described condition fulfilled.

The first line contains integer $ n $ $ (1<=n<=10^{5}) $ — the number of cards. The next line contains the sequence of integers — the numbers on Alexander's cards. The numbers are positive integers, each of them doesn't exceed $ 10^{8} $ .

If Arthur can write infinitely many distinct integers on the card, print on a single line -1. Otherwise, print on the first line the number of integers that suit you. In the second line, print the numbers in the increasing order. Note that the numbers in the answer can exceed $ 10^{8} $ or even be negative (see test samples).

3
4 1 7

2
-2 10

1
10

-1

4
1 3 5 9

1
7

4
4 3 4 5

0

2
2 4

3
0 3 6