There is a village along a road. This village has $N$ houses numbered $1$ to $N$ in order along the road. Each house has a field that can make up to two units of the crop and needs just one unit of the crop. The total cost to distribute one unit of the crop to each house is the summation of carrying costs and growing costs.
Your task is to calculate the minimum total cost to supply one unit of the crop to each house.
The input consists of a single test case formatted as follows.
$N$
$d_1$ ... $d_{N-1}$
$g_1$ ... $g_{N}$
The first line consists of an integer $N$ ($2 \leq 200,000$), which is the number of the houses. The second line consists of $N-1$ integers separated by spaces. The $i$-th integer $d_i$ ($1 \leq d_i \leq 10^9$, $1 \leq i \leq N-1$)represents the carrying cost between the $i$-th and the ($i+1$)-th houses. The third line consists of $N$ integers separated by spaces. The $i$-th integer $g_i$ ($1 \leq g_i \leq 10^9$, $1 \leq i \leq N$) represents the growing cost of the $i$-th house's field.
Print the minimum cost to supply one unit of the crop to each house.
2 3 1 5
5
3 100 100 1 2 3
6
4 1 2 3 1 1 100 100
12