In city street grids, intersections are often defined by two integers, counting the position of horizontal and vertical streets $($sometimes called streets and avenues$).$ Imagine traveling from position

to

$.$ How many blocks do you traverse?

An image of a street grid with different paths from point h$1,$ v$1$ to point h$2,$ v$2$

Even though there are many possible routes, the distance only depends on the differences

and

$.$ However, you need to take the absolute value because the differences might be negative.

Complete the following program that prints the number of blocks traveled, given the origin and destination of the trip $($which will change as your code is tested$).$