Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Inna, Dima and Song

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputInna is a great piano player and Dima is a modest guitar player. Dima has recently written a song and they want to play it together. Of course, Sereja wants to listen to the song very much.

A song is a sequence of notes. Dima and Inna want to play each note at the same time. At that, they can play the *i*-th note at volume *v* (1 ≤ *v* ≤ *a*_{i}; *v* is an integer) both on the piano and the guitar. They should retain harmony, so the total volume with which the *i*-th note was played on the guitar and the piano must equal *b*_{i}. If Dima and Inna cannot play a note by the described rules, they skip it and Sereja's joy drops by 1. But if Inna and Dima play the *i*-th note at volumes *x*_{i} and *y*_{i} (*x*_{i} + *y*_{i} = *b*_{i}) correspondingly, Sereja's joy rises by *x*_{i}·*y*_{i}.

Sereja has just returned home from the university and his current joy is 0. Help Dima and Inna play the song so as to maximize Sereja's total joy after listening to the whole song!

Input

The first line of the input contains integer *n* (1 ≤ *n* ≤ 10^{5}) — the number of notes in the song. The second line contains *n* integers *a*_{i} (1 ≤ *a*_{i} ≤ 10^{6}). The third line contains *n* integers *b*_{i} (1 ≤ *b*_{i} ≤ 10^{6}).

Output

In a single line print an integer — the maximum possible joy Sereja feels after he listens to a song.

Examples

Input

3

1 1 2

2 2 3

Output

4

Input

1

2

5

Output

-1

Note

In the first sample, Dima and Inna play the first two notes at volume 1 (1 + 1 = 2, the condition holds), they should play the last note at volumes 1 and 2. Sereja's total joy equals: 1·1 + 1·1 + 1·2 = 4.

In the second sample, there is no such pair (*x*, *y*), that 1 ≤ *x*, *y* ≤ 2, *x* + *y* = 5, so Dima and Inna skip a note. Sereja's total joy equals -1.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/24/2020 12:29:41 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|