#include <iostream>
#include <vector>

using namespace std;

// x0 x1 x2   x3 x4   x5 x6 x7 - n:=8
// x0 x1 x2   x3   x5 x6 - n:=7

int main() {
    int n;
    cin >> n;
    if(n < 1 || n > 100000) {
        cout << "-1" << endl;
        return -1;
    }

    vector<int> niz(n);

    // slozenost O(n)
    int x;
    for(int i = 0; i < n; i++) {
        cin >> x;
        if(x<0 || x > 100000) {
            cout << "-1" << endl;
            return -1;
        }
        niz[i] = x;
    }



    // pocetak algoritma

    // prvi argument
    cout << niz[0] << endl;

    for(int i = 2; i <= n; i++) {
        for(int j = i - 1; j > 0; j--) {
            if(niz[j-1] > niz[j]) {
                int temp = niz[j];
                niz[j] = niz[j-1];
                niz[j-1] = temp;
            }
            else break;
        }

        if(i%2==0) {
            cout << ((niz[i/2] + niz[i/2 - 1]) / 2.0) << endl;
        }
        else {
            cout << niz[i/2] << endl;
        }
    }
}