Algo lab/running times

This is part of ske algo lab

Task 1: Closest pairs

Task statement

You are given a list of n integers. You want to find the minimum difference between pairs of these integers.

Input

• First line: integer n
• Next n lines: each line contains one integer (ranging from 1 to 1,000,000,000)

Output

• One line: the minimum difference between pairs of these integers.