Candies#8767

Candies

1 second
128 megabytes
Very easy

Semen has candies and Yura candies. At the same time they both eat one of their own candies as long as each of them has at least one candy. Determine how many candies will remain after they stop eating the sweets.

Input

Two integers and (1 \leq n, m \leq 10^9) - the number of candies at Semen and Yura respectively.

Output

Print the number of candies that will remain.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading