#include <bits/stdc++.h>
using namespace std;
int n, a[310000], lg[310000], c[310000];
int MAX[310000][21], MIN[310000][21];
int getmin(int l, int r) {
  int len = r - l + 1;
  return min(MIN[l][lg[len]], MIN[r - (1 << lg[len]) + 1][lg[len]]);
}
int getmax(int l, int r) {
  int len = r - l + 1;
  return max(MAX[l][lg[len]], MAX[r - (1 << lg[len]) + 1][lg[len]]);
}
bool check(int s, int mid) {
  return ((double)getmin(s, mid) < (double)getmax(s, mid) / 2.0);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) a[i + n] = a[i + n + n] = a[i];
  bool bl = 1;
  int m = 0;
  for (int i = 1; i <= 3 * n; i++) {
    if ((double)a[i] < (double)m / 2.0) {
      bl = 0;
      break;
    }
    m = max(m, a[i]);
  }
  if (bl) {
    for (int i = 1; i <= n; i++) printf("-1 ");
    printf("\n");
    return 0;
  }
  for (int i = 1; i <= 3 * n + 1000; i++) lg[i] = (int)(log(i) / log(2));
  for (int i = 1; i <= 3 * n + 1; i++) MAX[i][0] = MIN[i][0] = a[i];
  for (int j = 1; j <= 20; j++) {
    for (int i = 1; i <= 3 * n; i++) {
      if (i + (1 << j) - 1 <= 3 * n) {
        MAX[i][j] = max(MAX[i][j - 1], MAX[i + (1 << (j - 1))][j - 1]);
        MIN[i][j] = min(MIN[i][j - 1], MIN[i + (1 << (j - 1))][j - 1]);
      }
    }
  }
  c[3 * n] = 1;
  for (int i = 3 * n - 1; i >= 1; i--) {
    int j, k;
    if ((double)getmin(i, 3 * n) >= (double)a[i] / 2.0)
      j = 3 * n + 1;
    else {
      int l, r;
      l = i;
      r = 3 * n;
      while (l < r) {
        int mid = (l + r) >> 1;
        if ((double)getmin(i, mid) < (double)a[i] / 2.0)
          r = mid;
        else
          l = mid + 1;
      }
      j = r;
    }
    if (getmax(i, 3 * n) <= a[i])
      k = 3 * n + 1;
    else {
      int l, r;
      l = i;
      r = 3 * n;
      while (l < r) {
        int mid = (l + r) >> 1;
        if (getmax(i, mid) > a[i])
          r = mid;
        else
          l = mid + 1;
      }
      k = r;
    }
    if (j <= k)
      c[i] = j - i;
    else
      c[i] = k - i + c[k];
  }
  for (int i = 1; i <= n; i++) printf("%d ", c[i]);
  printf("\n");
}
