Problem: In the year 2168, AtCoder Inc., which is much larger than now, is starting a limited express train service called AtCoder Express.

In the plan developed by the president Takahashi, the trains will run as follows:

* A train will run for (t_1 + t_2 + t_3 + ... + t_N) seconds.
* In the first t_1 seconds, a train must run at a speed of at most v_1 m/s (meters per second). Similarly, in the subsequent t_2 seconds, a train must run at a speed of at most v_2 m/s, and so on.



According to the specifications of the trains, the acceleration of a train must be always within ±1m/s^2. Additionally, a train must stop at the beginning and the end of the run.

Find the maximum possible distance that a train can cover in the run.

Constraints

* 1 \leq N \leq 100
* 1 \leq t_i \leq 200
* 1 \leq v_i \leq 100
* All input values are integers.

Input

Input is given from Standard Input in the following format:


N
t_1 t_2 t_3 … t_N
v_1 v_2 v_3 … v_N


Output

Print the maximum possible that a train can cover in the run.
Output is considered correct if its absolute difference from the judge's output is at most 10^{-3}.

Examples

Input

1
100
30


Output

2100.000000000000000


Input

2
60 50
34 38


Output

2632.000000000000000


Input

3
12 14 2
6 2 7


Output

76.000000000000000


Input

1
9
10


Output

20.250000000000000000


Input

10
64 55 27 35 76 119 7 18 49 100
29 19 31 39 27 48 41 87 55 70


Output

20291.000000000000

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Optional;
import java.util.function.Function;

interface F extends Function<Double, Double> {

}

public class Main {

	private interface F extends Function<Double, Optional<Double>> {
	}

	private static class LineFunction {
		List<F> list = new ArrayList<>();

		public boolean add(F f) {
			return this.list.add(f);
		}

		public Optional<Double> f(double x) {
			double min = Double.MAX_VALUE;
			for (F f : list) {
				Optional<Double> y = f.apply(x);
				if (y.isPresent()) {
					min = Math.min(min, y.get());
				}
			}
			if (min < Double.MAX_VALUE) {
				return Optional.of(min);
			}
			return Optional.empty();
		}
	}

	public static void main(String[] args) throws IOException {
		try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {
			br.readLine();
			int[] t = Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
			int[] v = Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();

			int n = t.length;
			int T = Arrays.stream(t).sum();

			LineFunction up = new LineFunction();

			{
				int lastTime = 0;
				double lastSpeed = 0;
				for (int i = 0; i < n; i++) {
					final double speed = lastSpeed;
					final int now = lastTime;
					final int time = t[i];
					final int vmax = v[i];

					final double needUpSpeed = vmax - speed;

					if (needUpSpeed > 0) {
						final double canUpSpeed = Math.min(needUpSpeed, t[i]);
						up.add(x -> {
							double dx = x - now;
							if (0 <= dx && dx <= canUpSpeed) {
								// y=x+b
								return Optional.of(dx + speed);
							} else if (canUpSpeed < dx && dx <= time) {
								// y=b
								return Optional.of(canUpSpeed + speed);
							}
							return Optional.empty();
						});
						lastSpeed += canUpSpeed;
					} else {
						if (vmax < speed) {
							up.add(x -> {
								double dx = x - now;
								if (dx < 0) {
									return Optional.of(-dx + vmax);
								} else if (dx <= time) {
									return Optional.of((double) vmax);
								}
								return Optional.empty();
							});
						} else {

							up.add(x -> {
								double dx = now - x;
								if (0 <= dx && dx <= time) {
									return Optional.of(speed);
								}
								return Optional.empty();

							});
						}
					}
					lastTime += time;
				}
			}
			LineFunction down = new LineFunction();
			{
				int lastTime = T;
				double lastSpeed = 0;
				for (int i = n - 1; i >= 0; i--) {
					final double speed = lastSpeed;
					final int now = lastTime;
					final int time = t[i];
					final int vmax = v[i];

					final double needUpSpeed = vmax - speed;

					if (needUpSpeed > 0) {
						final double canUpSpeed = Math.min(needUpSpeed, t[i]);
						down.add(x -> {
							double dx = now - x;
							if (0 <= dx && dx <= canUpSpeed) {
								// y=x+b
								return Optional.of(dx + speed);
							} else if (canUpSpeed < dx && dx <= time) {
								// y=b
								return Optional.of(canUpSpeed + speed);
							}
							return Optional.empty();
						});
						lastSpeed += canUpSpeed;
					} else {
						if (vmax < speed) {
							down.add(x -> {
								double dx = now - x;
								if (dx < 0) {
									return Optional.of(-dx + vmax);
								} else if (dx <= time) {
									return Optional.of((double) vmax);
								}
								return Optional.empty();
							});
						} else {
							down.add(x -> {
								double dx = now - x;
								if (0 <= dx && dx <= time) {
									return Optional.of(speed);
								}
								return Optional.empty();

							});
						}
					}
					lastTime -= time;
				}
			}

			double[] map = new double[2 * T + 1];
			for (int i = 0; i < 2 * T; i++) {
				double x = i / 2.0;
				Optional<Double> a = up.f(x);
				Optional<Double> b = down.f(x);

				if (a.isPresent() && b.isPresent()) {
					map[i] = Math.min(a.get(), b.get());
				} else if (a.isPresent()) {
					map[i] = a.get();
				} else if (b.isPresent()) {
					map[i] = b.get();
				}
			}
			System.out.println(ans(map));
		}

	}

	private static double ans(double[] map) {
		double sum = 0;

		for (int i = 1; i < map.length; i++) {
			sum += map[i - 1] + map[i];
		}

		return sum / 4.0;
	}

}