#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int a[N];
set<pair<int, int> > s;
int main() {
  int n, maxx, minx;
  scanf("%d", &n);
  maxx = -1e9;
  minx = 1e9;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    a[i + n] = a[i + n * 2] = a[i];
    maxx = max(maxx, a[i]);
    minx = min(minx, a[i]);
  }
  if (minx * 2 >= maxx) {
    for (int i = 1; i <= n; i++) printf("-1 ");
    printf("\n");
    return 0;
  }
  s.insert({-1e9, 0});
  maxx = -1e9;
  for (int i = 1, r = 0; i <= n; i++) {
    while (r < n * 3) {
      if (a[r + 1] < (maxx + 1) / 2)
        break;
      else {
        r++;
        maxx = max(maxx, a[r]);
        s.insert({a[r], r});
      }
    }
    printf("%d ", r - i + 1);
    s.erase({a[i], i});
    auto it = s.end();
    it--;
    maxx = (*it).first;
  }
  printf("\n");
  return 0;
}
