Almost Always

아직 제출이 없습니다시간 제한2초메모리 제한1024 MB

문제

Today, your probability theory class covered probabilistic events that occur with high probability. As you are now explaining to your friend, this means that as some parameter nn goes to infinity, the probability of this event goes to 11.

An example of an event that occurs with high probability is the following: given a list of nn independent uniform random integers between 11 and 21092\cdot 10^9, there are two elements such that one divides the other.

Your friend does not believe this, as he can easily come up with many examples where no number divides any other number: Just take any subset of 109+1,109+2,,2109\\{10^9+1, 10^{9}+2, \dots, 2\cdot 10^9\\} and none of these will divide any other!

To convince your friend, you will show him that you can find two elements that divide each other for exactly 100100 instances of the problem. You are confident this will succeed, since the probability of failure is in fact less than 102510^{-25} per instance when n=5105n=5\cdot 10^5.

입력

The input consists of:

  • One line with an integer nn, the number of integers in the list.
  • One line containing nn independent random integers a_1,,a_na\_1, \ldots, a\_n, drawn uniformly from 1,2,,2109\\{1, 2, \ldots, 2\cdot 10^9\\}.

Your submission will be run on exactly 100100 test cases, all of which will have n=5105n=5\cdot 10^5. The samples are smaller and for illustration only.

Each of your submissions will be run on new random test cases.

출력

Output two distinct integers ii and jj, indicating that a_ia\_{i} divides a_ja\_{j}.