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.
Two integers and (1 \leq n, m \leq 10^9) - the number of candies at Semen and Yura respectively.
Print the number of candies that will remain.
Example 1
Example 2