#include <bits/stdc++.h>
using namespace std;
priority_queue<pair<int, int>, vector<pair<int, int> > > q;
int a[300005], vt[300005], res[300005];
int n;
void nhap() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    a[i + n] = a[i];
    a[i + 2 * n] = a[i];
    res[i] = -1;
  }
}
void xl() {
  int l = 1;
  pair<int, int> x;
  x.first = a[1];
  x.second = 1;
  q.push(x);
  n = n * 3;
  for (int i = 2; i <= n; ++i) {
    while (!q.empty() && a[i] * 2 < q.top().first) {
      int x = q.top().second;
      q.pop();
      while (l <= x) {
        res[l] = i - l;
        ++l;
      }
    }
    pair<int, int> x;
    x.first = a[i];
    x.second = i;
    q.push(x);
  }
  for (int i = 1; i <= n / 3; ++i) cout << res[i] << ' ';
}
int main() {
  nhap();
  xl();
  return 0;
}
