eolymp
bolt
Try our new interface for solving problems
Problems

Candies

Candies

Time limit 1 second
Memory limit 128 MiB

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

Input data

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

Output data

Print the number of candies that will remain.

Examples

Input example #1
6 3
Output example #1
3
Input example #2
7 7
Output example #2
0
Source 2019 ACM, SEERC, 1/8 finals, April 13