#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long long int a[3 * n + 1];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    a[n + i] = a[i], a[2 * n + i] = a[i];
  }
  multiset<long long int> s;
  int j = 0;
  for (int i = 0; i < n; i++) {
    while (s.empty() || (*s.rbegin()) <= a[j] * 2) {
      s.insert(a[j++]);
      if (j - i > 2 * n) {
        for (int i = 0; i < n; i++) cout << "-1 ";
        return 0;
      }
    }
    cout << j - i << " ";
    s.erase(s.find(a[i]));
  }
}
