#include <bits/stdc++.h>
using namespace std;
int n, sum, freq[50];
vector<int> ans, v;
vector<long long> temp;
void no() {
  puts("-1");
  exit(0);
}
int main() {
  scanf("%d", &n);
  long long a;
  for (int i = 0; i < n; i++) {
    scanf("%lld", &a);
    if (a & (a - 1)) {
      temp.push_back(a);
      continue;
    }
    int count = 0;
    while (a > 1) {
      count++;
      a >>= 1;
    }
    freq[count]++;
  }
  sum = n - freq[0];
  v.resize(freq[0]);
  for (long long i = 1; i < 50; i++) {
    for (int j = 0; j < v.size() && freq[i]; j++, freq[i]--) {
      if (v[j] + 1 != i) break;
      sum--;
      v[j]++;
    }
  }
  for (int i = 1; i < 50; i++)
    while (freq[i]--) temp.push_back(1LL << i);
  sort(temp.rbegin(), temp.rend());
  if (v.size() < sum) no();
  for (int i = 0; i < temp.size(); i++)
    if (temp[i] > (1LL << (v[i] + 1))) no();
  ans.push_back(v.size());
  while (v.size() > 1) {
    if (v.size() - 1 < sum + v.back() + 1) break;
    for (int i = 0; i < v.back() + 1; i++)
      if ((1LL << (v.back() - i)) > (1LL << (v[sum + i] + 1))) no();
    sum += v.back() + 1;
    v.pop_back();
    ans.push_back(v.size());
  }
  reverse(ans.begin(), ans.end());
  for (auto i : ans) printf("%d ", i);
}
