#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int LOGN = 22;
int v[MAXN], dp[MAXN];
int sdp[MAXN][LOGN + 5], jump[MAXN][LOGN + 5];
int n, mxi;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &v[i]);
    if (v[i] > v[mxi]) mxi = i;
    jump[i][0] = min(i + 1, n - 1);
    sdp[i][0] = v[i];
    if (i != 0) sdp[i - 1][0] = min(sdp[i - 1][0], v[i]);
  }
  for (int k = 1; k <= LOGN; k++) {
    for (int i = 0; i < n; i++) {
      int a = jump[i][k - 1];
      jump[i][k] = jump[a][k - 1];
      sdp[i][k] = min(sdp[i][k - 1], sdp[a][k - 1]);
    }
  }
  for (int i = 0; i < n; i++) {
    int a = i;
    int b = 0;
    for (int k = LOGN - 1; k >= 0; k--)
      if (sdp[a][k] * 2 >= v[i]) a = jump[a][k];
    for (int k = LOGN - 1; k >= 0; k--)
      if (sdp[b][k] * 2 >= v[i]) b = jump[b][k];
    dp[i] = a - i + 1;
    if ((a == n - 1) && (v[0] * 2 >= v[i])) dp[i] += (b + 1);
    if (dp[i] > n) dp[i] = 5 * n;
  }
  for (int i = (mxi - 1 + n) % n; i != mxi; i = (i - 1 + n) % n) {
    int j = (i + 1) % n;
    dp[i] = min(dp[i], dp[j] + 1);
  }
  for (int i = 0; i < n; i++) printf("%d ", dp[i] < 3 * n ? dp[i] : -1);
}
