PROGRAMMING:Phone chat maniac
Given a large number of mobile phone users' call records, find out the chat maniac who has the most calls.
###Input format:
Input first gives a positive integer $$n $$($$Le 10 ^ 5 $$), which is the number of call records. The next $$n $$line, each line gives a call record. For simplicity, only 11 digit mobile phone numbers of the sender and receiver are listed here, separated by spaces.
###Output format:
In one line, give the mobile phone number of the chat maniac and the number of calls, separated by spaces. If such a person is not unique, the minimum number and the number of calls among the madmen will be output, and the number of parallel madmen will be given additionally.
###Input example:
```in
four
13005711862 13588625832
13505711862 13088625832
13588625832 18087925832
15005713862 13588625832
```
###Output example:
```out
13588625832 3
```
answer：If there is no answer, please comment
###Input format:
Input first gives a positive integer $$n $$($$Le 10 ^ 5 $$), which is the number of call records. The next $$n $$line, each line gives a call record. For simplicity, only 11 digit mobile phone numbers of the sender and receiver are listed here, separated by spaces.
###Output format:
In one line, give the mobile phone number of the chat maniac and the number of calls, separated by spaces. If such a person is not unique, the minimum number and the number of calls among the madmen will be output, and the number of parallel madmen will be given additionally.
###Input example:
```in
four
13005711862 13588625832
13505711862 13088625832
13588625832 18087925832
15005713862 13588625832
```
###Output example:
```out
13588625832 3
```
answer：If there is no answer, please comment