problem

Given $ N $ different natural numbers $ a_i $. I decided to make a pair by choosing a different natural number from the given natural numbers. Output one pair that can be created with a value difference that is a multiple of $ N -1 $.

It should be noted that such a pair always exists.





Example

Input

5
1 2 4 7 10


Output

2 10
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin>>n;
    int a[1001];
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    int ans1,ans2;
    for(int i=0;i<n;++i) for(int j=0;j<n;j++)
    {
        if(i==j) continue;
        if(abs(a[i]-a[j])%(n-1)==0)
        {
            ans1=a[i];
            ans2=a[j];
            break;
        }
    }
    cout << ans1 << " " << ans2 << endl;
    return 0;
}
