Minimum Time Visiting All Points

On a 2D plane you can move one unit vertically, horizontally or diagonally per second. Print the minimum time to visit the given points in the given order.

1 <= n <= 100 -1000 <= x, y <= 1000