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

The problem statement has recently been changed. View the changes.

×
A. Friends Meeting

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputTwo friends are on the coordinate axis *Ox* in points with integer coordinates. One of them is in the point *x*_{1} = *a*, another one is in the point *x*_{2} = *b*.

Each of the friends can move by one along the line in any direction unlimited number of times. When a friend moves, the tiredness of a friend changes according to the following rules: the first move increases the tiredness by 1, the second move increases the tiredness by 2, the third — by 3 and so on. For example, if a friend moves first to the left, then to the right (returning to the same point), and then again to the left his tiredness becomes equal to 1 + 2 + 3 = 6.

The friends want to meet in a integer point. Determine the minimum total tiredness they should gain, if they meet in the same point.

Input

The first line contains a single integer *a* (1 ≤ *a* ≤ 1000) — the initial position of the first friend.

The second line contains a single integer *b* (1 ≤ *b* ≤ 1000) — the initial position of the second friend.

It is guaranteed that *a* ≠ *b*.

Output

Print the minimum possible total tiredness if the friends meet in the same point.

Examples

Input

3

4

Output

1

Input

101

99

Output

2

Input

5

10

Output

9

Note

In the first example the first friend should move by one to the right (then the meeting happens at point 4), or the second friend should move by one to the left (then the meeting happens at point 3). In both cases, the total tiredness becomes 1.

In the second example the first friend should move by one to the left, and the second friend should move by one to the right. Then they meet in the point 100, and the total tiredness becomes 1 + 1 = 2.

In the third example one of the optimal ways is the following. The first friend should move three times to the right, and the second friend — two times to the left. Thus the friends meet in the point 8, and the total tiredness becomes 1 + 2 + 3 + 1 + 2 = 9.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/05/2023 01:28:59 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|