• 맨해튼 거리로 가장 멀리 떨어진 두 점을 찾는 문제.
• 풀이 방법은 링크에 설명되어있다. 시간복잡도는 O(n)

"""Solution code for "BOJ 2381. 최대 거리".

- Problem link: https://www.acmicpc.net/problem/2381
- Solution link: http://www.teferi.net/ps/problems/boj/2381

Tags: [geometry]
"""

import sys


def farthest_points_pair_manhattan(points):
    sums = [x + y for x, y in points]
    max_sum, min_sum = max(sums), min(sums)
    diffs = [x - y for x, y in points]
    max_diff, min_diff = max(diffs), min(diffs)
    return max(max_sum - min_sum, max_diff - min_diff)


def main():
    N = int(sys.stdin.readline())
    points = [[int(x) for x in sys.stdin.readline().split()] for _ in range(N)]

    print(farthest_points_pair_manhattan(points))


if __name__ == '__main__':
    main()