Elena goes to a very weird school where the attendance criteria is for each day of the semester. She is very lazy and thinks of ways to spend minimum time at the school. There are a total of N lectures tomorrow out of which she has to attend at least 75% of the lectures. Tell her at which time she should go to attend the lectures and the time that she should come back so that she spends least amount of time at school.
Of course you don’t want her to fail due to “low attendance”.
If there are multiple answers then print the one in which she goes to school late.
First line contains an integer N, the number of lectures.
Second line contains N space separated integers representing the time of commencement of ith lecture.
Print two space separated integers, first being the time she goes to school and second being the time she returns from the school.
0 < N <= 1e6
0 < time[i] <= 1e9
5 7 2 8 6 9 10 15
Note: Each lecture is of 1 hour of duration and no two lectures start at same time.