#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
vector<int> best;
void rec(vector<int> a, vector<int> r, int k) {
  if (!int((a).size())) {
    if (int((best).size()) > int((r).size())) {
      best = r;
    }
    return;
  }
  if (k == 20) {
    return;
  }
  int found = 0;
  for (int x : a) {
    if (x & 1) {
      found = 1;
      break;
    }
  }
  if (!found) {
    vector<int> na;
    for (int x : a) {
      x /= 2;
      if (x) na.push_back(x);
    }
    (na).erase(unique((na).begin(), (na).end()), (na).end());
    rec(na, r, k + 1);
    return;
  }
  for (int i = -1; i <= 1; i += 2) {
    vector<int> na;
    for (int x : a) {
      if (x & 1) {
        x = (x - i) / 2;
      } else {
        x /= 2;
      }
      if (x) na.push_back(x);
    }
    (na).erase(unique((na).begin(), (na).end()), (na).end());
    vector<int> nr = r;
    nr.push_back(i * (1 << k));
    rec(na, nr, k + 1);
  }
}
void chemthan() {
  int n;
  cin >> n;
  vector<int> a;
  for (int i = (0); i < (n); ++i) {
    int x;
    cin >> x;
    if (x) a.push_back(x);
  }
  sort((a).begin(), (a).end()),
      (a).erase(unique((a).begin(), (a).end()), (a).end());
  for (int i = (0); i < (100); ++i) best.push_back(i);
  rec(a, vector<int>(), 0);
  cout << int((best).size()) << "\n";
  for (int i = (0); i < (int((best).size())); ++i)
    cout << best[i] << " \n"[i == int((best).size()) - 1];
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
