Candies
Execution time limit is 1 second
Runtime memory usage limit is 128 megabytes
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
Two integers n and m (1 ≤ n, m ≤ 10^9) - the number of candies at Semen and Yura respectively.
Output
Print the number of candies that will remain.
Examples
Input #1
Answer #1
Input #2
Answer #2
Submissions 7K
Acceptance rate 54%