#include <bits/stdc++.h>
using namespace std;
int main() {
  int N;
  cin >> N;
  vector<long long> C(1), other;
  int oCnt = 0;
  long long temp;
  long long curr = 1;
  for (int i = 0; i < N; i++) {
    cin >> temp;
    while (temp > curr) {
      curr *= 2;
      C.push_back(0);
    }
    if (temp == curr)
      C.back()++;
    else if (temp < curr) {
      oCnt++;
      other.push_back(temp);
    }
  }
  for (int i = 1; i < C.size(); i++) {
    if (C[i] > C[i - 1]) {
      oCnt += C[i] - C[i - 1];
      for (int j = 0; j < C[i] - C[i - 1]; j++)
        other.push_back((long long)1 << i);
      C[i] = C[i - 1];
    }
  }
  while (!C.empty() and C.back() == 0) C.pop_back();
  if (C.empty() or C[0] < oCnt) {
    cout << -1 << endl;
    return 0;
  }
  sort(other.begin(), other.end());
  for (int i = C.size() - 1; i >= 0; i--) {
    int extra = (i + 1 == C.size()) ? C[i] : C[i] - C[i + 1];
    for (int j = 0; j < extra; j++) {
      long long temp = ((long long)1 << (i + 1));
      if (!other.empty() and temp >= other.back()) other.pop_back();
    }
  }
  if (!other.empty()) {
    cout << -1 << endl;
    return 0;
  }
  int maxM = C[0];
  int minM = 0;
  while (!C.empty()) {
    minM++;
    for (int i = 0; i < C.size(); i++) C[i]--;
    while (!C.empty() and C.back() == 0) C.pop_back();
    if (oCnt > 0)
      oCnt--;
    else {
      for (int i = 0; i < C.size(); i++) {
        if (i + 1 == C.size() or C[i] > C[i + 1]) {
          C[i]--;
          break;
        }
      }
    }
    while (!C.empty() and C.back() == 0) C.pop_back();
  }
  for (int i = minM; i <= maxM; i++) cout << i << (i != maxM ? " " : "");
  cout << endl;
}
