A manager of Starbucks franchise wants to investigate market competition levels of local area nearby. Write a java program that identifies the nearest pair of Starbucks branches given the location information below.

#	X	y
1	1	5
2	3	30
3	5	10
4	9	24
5	11	22
6	11	20
7	9	4
8	17	25
9	22	30
10	25	19
11	21	5
12	28	32
13	30	31
14	31	1

distance between branch A and B = |x of A x of B| + |y of A y of B|

e.g. distance between 1 and 3= |1-5|+|5-10| = 9