Problem: It is never too late to play the fancy "Binary Cards" game!

There is an infinite amount of cards of positive and negative ranks that are used in the game. The absolute value of any card rank is a power of two, i.e. each card has a rank of either 2k or  - 2k for some integer k ≥ 0. There is an infinite amount of cards of any valid rank.

At the beginning of the game player forms his deck that is some multiset (possibly empty) of cards. It is allowed to pick any number of cards of any rank but the small deck is considered to be a skill indicator. Game consists of n rounds. In the i-th round jury tells the player an integer ai. After that the player is obligated to draw such a subset of his deck that the sum of ranks of the chosen cards is equal to ai (it is allowed to not draw any cards, in which case the sum is considered to be equal to zero). If player fails to do so, he loses and the game is over. Otherwise, player takes back all of his cards into his deck and the game proceeds to the next round. Player is considered a winner if he is able to draw the suitable set of cards in each of the rounds.

Somebody told you which numbers ai the jury is going to tell you in each round. Now you want to pick a deck consisting of the minimum number of cards that allows you to win the "Binary Cards" game.

Input

The first line of input contains an integer n (1 ≤ n ≤ 100 000), the number of rounds in the game.

The second line of input contains n integers a1, a2, ..., an ( - 100 000 ≤ ai ≤ 100 000), the numbers that jury is going to tell in each round.

Output

In the first line print the integer k (0 ≤ k ≤ 100 000), the minimum number of cards you have to pick in your deck in ordered to win the "Binary Cards".

In the second line print k integers b1, b2, ..., bk ( - 220 ≤ bi ≤ 220, |bi| is a power of two), the ranks of the cards in your deck. You may output ranks in any order. If there are several optimum decks, you are allowed to print any of them.

It is guaranteed that there exists a deck of minimum size satisfying all the requirements above.

Examples

Input

1
9


Output

2
1 8


Input

5
-1 3 0 4 7


Output

3
4 -1 4


Input

4
2 -2 14 18


Output

3
-2 2 16

Note

In the first sample there is the only round in the game, in which you may simply draw both your cards. Note that this sample test is the only one satisfying the first test group constraints.

In the second sample you may draw the only card  - 1 in the first round, cards 4 and  - 1 in the second round, nothing in the third round, the only card 4 in the fourth round and the whole deck in the fifth round.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, ans = 2e9, ans3, tot, cnt, a[50][N], ans2[N], oopt[N], opt[N], sum[N];
int power(int a, int b) {
  int res = 1, tmp = a;
  while (b) {
    if (b & 1) res = res * tmp;
    tmp = tmp * tmp;
    b >>= 1;
  }
  return res;
}
void dfs(int dep, int len, int res) {
  if (res > ans || dep > 41) return;
  bool ok = 0;
  for (int i = 1; i <= len; i++)
    if (a[dep][i]) {
      ok = 1;
      break;
    }
  if (ok == 0) {
    ans = res;
    cnt = tot;
    for (int i = 1; i <= tot; i++) oopt[i] = opt[i];
    return;
  }
  bool flag = 0;
  for (int i = 1; i <= len; i++)
    if (a[dep][i] % 2) {
      flag = 1;
      break;
    }
  if (flag == 0) {
    opt[++tot] = 3;
    for (int i = 1; i <= len; i++) a[dep + 1][i] = a[dep][i] / 2;
    int m = unique(a[dep + 1] + 1, a[dep + 1] + len + 1) - a[dep + 1] - 1;
    dfs(dep + 1, m, res);
    tot--;
  } else {
    opt[++tot] = 1;
    for (int i = 1; i <= len; i++) {
      a[dep + 1][i] = a[dep][i];
      if (a[dep][i] % 2) a[dep + 1][i]++;
    }
    int m = unique(a[dep + 1] + 1, a[dep + 1] + len + 1) - a[dep + 1] - 1;
    dfs(dep + 1, m, res + 1);
    tot--;
    opt[++tot] = 2;
    for (int i = 1; i <= len; i++) {
      a[dep + 1][i] = a[dep][i];
      if (a[dep][i] % 2) a[dep + 1][i]--;
    }
    m = unique(a[dep + 1] + 1, a[dep + 1] + len + 1) - a[dep + 1] - 1;
    dfs(dep + 1, m, res + 1);
    tot--;
  }
  return;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[0][i]);
  sort(a[0] + 1, a[0] + n + 1);
  dfs(0, n, 0);
  printf("%d\n", ans);
  for (int i = 1; i <= cnt; i++) sum[i] = sum[i - 1] + (oopt[i] == 3);
  for (int i = 1; i <= cnt; i++) {
    if (oopt[i] == 1)
      ans2[++ans3] = -1 * power(2, sum[i]);
    else if (oopt[i] == 2)
      ans2[++ans3] = power(2, sum[i]);
  }
  for (int i = 1; i <= ans3; i++) printf("%d ", ans2[i]);
  return 0;
}