Problem: There are n water tanks in a row, i-th of them contains a_i liters of water. The tanks are numbered from 1 to n from left to right.

You can perform the following operation: choose some subsegment [l, r] (1≤ l ≤ r ≤ n), and redistribute water in tanks l, l+1, ..., r evenly. In other words, replace each of a_l, a_{l+1}, ..., a_r by \frac{a_l + a_{l+1} + ... + a_r}{r-l+1}. For example, if for volumes [1, 3, 6, 7] you choose l = 2, r = 3, new volumes of water will be [1, 4.5, 4.5, 7]. You can perform this operation any number of times.

What is the lexicographically smallest sequence of volumes of water that you can achieve?

As a reminder:

A sequence a is lexicographically smaller than a sequence b of the same length if and only if the following holds: in the first (leftmost) position where a and b differ, the sequence a has a smaller element than the corresponding element in b.

Input

The first line contains an integer n (1 ≤ n ≤ 10^6) — the number of water tanks.

The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^6) — initial volumes of water in the water tanks, in liters.

Because of large input, reading input as doubles is not recommended.

Output

Print the lexicographically smallest sequence you can get. In the i-th line print the final volume of water in the i-th tank.

Your answer is considered correct if the absolute or relative error of each a_i does not exceed 10^{-9}.

Formally, let your answer be a_1, a_2, ..., a_n, and the jury's answer be b_1, b_2, ..., b_n. Your answer is accepted if and only if \frac{|a_i - b_i|}{max{(1, |b_i|)}} ≤ 10^{-9} for each i.

Examples

Input


4
7 5 5 7


Output


5.666666667
5.666666667
5.666666667
7.000000000


Input


5
7 8 8 10 12


Output


7.000000000
8.000000000
8.000000000
10.000000000
12.000000000


Input


10
3 9 5 5 1 7 5 3 8 7


Output


3.000000000
5.000000000
5.000000000
5.000000000
5.000000000
5.000000000
5.000000000
5.000000000
7.500000000
7.500000000

Note

In the first sample, you can get the sequence by applying the operation for subsegment [1, 3].

In the second sample, you can't get any lexicographically smaller sequence.

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.util.BitSet;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author AnandOza
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CWaterBalance solver = new CWaterBalance();
        solver.solve(1, in, out);
        out.close();
    }

    static class CWaterBalance {
        double[] a;
        int n;
        UnionFind uf;
        int[] min;
        int[] max;
        BitSet visited;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            n = in.nextInt();
            a = new double[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.nextDouble();
            }

            double[] answer = solveFaster();

            for (double x : answer) {
                out.println(String.format("%.15e", x));
            }
        }

        private double[] solveFaster() {
//        int[] indices = Permutations.identity(n);
//        Util.shuffle(indices);

            uf = new UnionFind(n);
            min = Permutations.identity(n);
            max = Permutations.identity(n);
            visited = new BitSet(n);

            long saved = 0;
//        for (int i : indices) {
            for (int i = 0; i < n; i++) {
                if (visited.get(uf.rep(i)))
                    continue;
//            int l = min(i), r = max(i);
                int l = i, r = i;
                boolean done = false;
                while (!done) {
                    done = true;
                    if (l - 1 >= 0 && a[uf.rep(l - 1)] > a[uf.rep(l)]) {
                        merge(l - 1, l);
//                    l--;
//                    saved += Math.abs(l - min(l));
                        l = min[uf.rep(l)];
                        done = false;
                    }
                    if (r + 1 < n && a[uf.rep(r)] > a[uf.rep(r + 1)]) {
                        merge(r, r + 1);
//                    r++;
//                    saved += Math.abs(r - max(r));
                        r = max[uf.rep(r)];
                        done = false;
                    }
                }
                visited.set(uf.rep(i));
            }

            double[] answer = new double[n];
            for (int i = 0; i < n; i++) {
                answer[i] = a[uf.rep(i)];
            }

            return answer;
        }

        private void merge(int i, int j) {
            double sum = a[uf.rep(i)] * uf.size(i) + a[uf.rep(j)] * uf.size(j);
//        int mi = Math.min(min[uf.rep(i)], min[uf.rep(j)]);
//        int ma = Math.max(max[uf.rep(i)], max[uf.rep(j)]);
            int mi = min[uf.rep(i)];
            int ma = max[uf.rep(j)];
            uf.union(i, j);
            a[uf.rep(i)] = sum / uf.size(i);
            min[uf.rep(i)] = mi;
            max[uf.rep(i)] = ma;
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

    }

    static class Permutations {
        public static int[] identity(int n) {
            int[] p = new int[n];
            for (int i = 0; i < n; i++) {
                p[i] = i;
            }
            return p;
        }

        private Permutations() {
        }

    }

    static class UnionFind {
        private int[] __rep;
        private int[] __size;

        public UnionFind(int n) {
            __rep = new int[n];
            __size = new int[n];
            for (int i = 0; i < n; i++) {
                __rep[i] = i;
                __size[i] = 1;
            }
        }

        public int rep(int x) {
            if (__rep[x] == x) {
                return x;
            }

            int r = rep(__rep[x]);
            __rep[x] = r;
            return r;
        }

        public int size(int x) {
            return __size[rep(x)];
        }

        public boolean union(int x, int y) {
            x = rep(x);
            y = rep(y);

            if (x == y) {
                return false;
            }

            if (size(x) < size(y)) {
                int t = x;
                x = y;
                y = t;
            }

            // now size(x) >= size(y)

            __rep[y] = x;
            __size[x] += __size[y];
            return true;
        }

    }
}