#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 1e7 + 7;
int n, ma, mi, a[300010];
int r[300010], tmp, ans[300010];
int root;
struct A {
  int cnt, c[N], lc[N], rc[N];
  int mint(int p, int l, int r, int x, int y) {
    if (!p) return 3 * n + 1;
    if (l >= x && r <= y) return c[p];
    int mid = (l + r) >> 1;
    if (y <= mid) return mint(lc[p], l, mid, x, y);
    if (x > mid) return mint(rc[p], mid + 1, r, x, y);
    return min(mint(lc[p], l, mid, x, y), mint(rc[p], mid + 1, r, x, y));
  }
  void addt(int &p, int l, int r, int x, int k) {
    if (!p) p = ++cnt;
    if (l == r) {
      c[p] = k;
      return;
    }
    int mid = (l + r) >> 1;
    if (x <= mid)
      addt(lc[p], l, mid, x, k);
    else
      addt(rc[p], mid + 1, r, x, k);
    c[p] = min(c[lc[p]], c[rc[p]]);
  }
} tree;
int main() {
  cin >> n;
  mi = inf;
  ma = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", a + i);
    a[2 * n + i] = a[n + i] = a[i];
    ma = max(ma, a[i]);
    mi = min(mi, a[i]);
  }
  if (mi * 2 >= ma) {
    for (int i = 1; i < n; i++) printf("-1 ");
    puts("-1");
    return 0;
  }
  tree.c[0] = 3 * n + 1;
  for (int i = 3 * n; i >= 1; i--) {
    tree.addt(root, 1, 1e9, a[i], i);
    r[i] = tree.mint(root, 1, 1e9, 1, (a[i] - 1) / 2);
  }
  tmp = 3 * n + 1;
  for (int i = 3 * n; i >= 1; i--) {
    tmp = min(tmp, r[i]);
    ans[i] = tmp - i;
  }
  for (int i = 1; i < n; i++) printf("%d ", ans[i]);
  printf("%d\n", ans[n]);
  return 0;
}
