#include <bits/stdc++.h>
using namespace std;
long long int n;
vector<long long int> powersOfTwo;
vector<long long int> residues;
vector<long long int> solutions;
long long int cp;
void process(long long int m) {
  long long int residuesAvailable = 0;
  long long int currentCatching = m;
  long long int lost;
  for (int i = 0; i <= cp + 1; i++) {
    if (powersOfTwo[i] >= currentCatching) {
      residuesAvailable += residues[i] + powersOfTwo[i] - currentCatching;
    } else if (i > 0) {
      lost = min(currentCatching - powersOfTwo[i], residuesAvailable);
      currentCatching = powersOfTwo[i];
      residuesAvailable += -lost + residues[i];
    } else {
      return;
    }
  }
  if (residuesAvailable == 0) {
    solutions.push_back(m);
  }
}
int main() {
  powersOfTwo = vector<long long int>(50, 0);
  residues = vector<long long int>(50, 0);
  solutions = vector<long long int>();
  long long int cpower = 1;
  cp = 0;
  long long int input;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> input;
    if (input == cpower) {
      powersOfTwo[cp]++;
    } else if (cpower < input && 2 * cpower > input) {
      residues[cp]++;
    } else {
      while (2 * cpower <= input) {
        cpower = cpower * 2;
        cp++;
      }
      if (input == cpower) {
        powersOfTwo[cp]++;
      } else {
        residues[cp]++;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    process(i);
  }
  if (solutions.size() == 0) {
    cout << -1 << endl;
  } else {
    for (int i = 0; i < solutions.size(); i++) {
      cout << solutions[i] << " ";
    }
    cout << endl;
  }
}
