#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 15;
int a[N], ans[N];
multiset<int> se;
int main() {
  int n;
  cin >> n;
  int n3 = n * 3;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    a[n + i] = a[2 * n + i] = a[i];
  }
  int r = 1;
  for (int i = 1; i <= n; i++) {
    while (r <= n3) {
      if (se.size()) {
        int p = *se.rbegin();
        if (a[r] * 2 < p) break;
      }
      se.insert(a[r]);
      r++;
    }
    if (r <= n3)
      ans[i] = r - i;
    else
      ans[i] = -1;
    se.erase(se.find(a[i]));
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
