Problem:       
    HAI  
    I HAS A TUX  
    GIMMEH TUX  
    I HAS A FOO ITS 0  
    I HAS A BAR ITS 0  
    I HAS A BAZ ITS 0  
    I HAS A QUZ ITS 1  
    TUX IS NOW A NUMBR  
    IM IN YR LOOP NERFIN YR TUX TIL BOTH SAEM TUX AN 0  
    I HAS A PUR  
    GIMMEH PUR  
    PUR IS NOW A NUMBR  
    FOO R SUM OF FOO AN PUR  
    BAR R SUM OF BAR AN 1  
    BOTH SAEM BIGGR OF PRODUKT OF FOO AN QUZ AN PRODUKT OF BAR BAZ AN PRODUKT OF FOO AN QUZ  
    O RLY?  
    YA RLY  
    BAZ R FOO  
    QUZ R BAR  
    OIC  
    IM OUTTA YR LOOP  
    BAZ IS NOW A NUMBAR  
    VISIBLE SMOOSH QUOSHUNT OF BAZ QUZ  
    KTHXBYE  
    

Input

The input contains between 1 and 10 lines, i-th line contains an integer number xi (0 ≤ xi ≤ 9).

Output

Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 4.

Examples

Input

3
0
1
1


Output

0.666667

Solution (in JAVA):

Solution:
import static java.lang.Math.*;
import static java.lang.System.currentTimeMillis;
import static java.lang.System.exit;
import static java.lang.System.arraycopy;
import static java.util.Arrays.sort;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.fill;
import java.util.*;
import java.io.*;

public class Main {

	public static void main(String[] args) throws IOException {
		try {
			if (new File("input.txt").exists())
				System.setIn(new FileInputStream("input.txt"));
		} catch (SecurityException e) {
		}
		new Thread(null, new Runnable() {
			public void run() {
				try {
					new Main().run();
				} catch (Throwable e) {
					e.printStackTrace();
					exit(999);
				}
			}
		}, "1", 1 << 23).start();
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer st = new StringTokenizer("");

	private void run() throws IOException {
		in = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		solve();
		in.close();
		out.close();
	}

	private void solve() throws IOException {
		int foo = 0;
		int bar = 0;
		int baz = 0;
		int quz = 1;
		int n = nextInt();
		for (int i = 0; i < n; i++) {
			int pur = nextInt();
			foo += pur;
			bar++;
			if (max(foo * quz, bar * baz) == foo * quz) {
				baz = foo;
				quz = bar;
			}
		}
		out.println(1. * baz / quz);
	}

	void chk(boolean b) {
		if (b)
			return;
		System.out.println(new Error().getStackTrace()[1]);
		exit(999);
	}
	void deb(String fmt, Object... args) {
		System.out.printf(Locale.US, fmt + "%n", args);
	}
	String nextToken() throws IOException {
		while (!st.hasMoreTokens())
			st = new StringTokenizer(in.readLine());
		return st.nextToken();
	}
	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}
	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}
	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
	String nextLine() throws IOException {
		st = new StringTokenizer("");
		return in.readLine();
	}
	boolean EOF() throws IOException {
		while (!st.hasMoreTokens()) {
			String s = in.readLine();
			if (s == null)
				return true;
			st = new StringTokenizer(s);
		}
		return false;
	}
}