PROGRAMMING:Double Eleven

During the "double 11" period, a famous e-commerce platform "Dongdong" is preparing to add another self operated warehouse in n cities to cope with the sales peak. The requirement is that the warehouse should be located in one of the n cities, and the shortest distance from all other cities is the smallest. Please write a program to help Dongdong find out where to set up the warehouse. Suppose that n cities are numbered from 0 to n-1, and at least one of them is accessible to all other cities.
###Input format:
The input contains multiple sets of data. The first line of each group of data is two positive integers n and E, which are not more than 100. N is the number of cities. Next, line e represents the distance information between the two cities, and each line contains three non negative integers a, B and C, where a and B represent the number of the two cities, and C represents the distance between the cities.
Tip: EOF can be used to judge the end of input.
###Output format:
The output is an integer, which indicates the city number of the warehouse. If multiple cities meet the requirements, the smallest number will be output.
###Input example:
```in
6 5
0 1 1
0 2 1
0 3 1
0 4 1
0 5 1
4 5
0 1 1
0 2 5
1 2 2
1 3 4
2 3 1
```
###Output example:
```out
0
one
```







answer：If there is no answer, please comment