#include <bits/stdc++.h>
using namespace std;
#define ll                 long long 
#define all(v)             v.begin(), v.end()
ll ceil2(ll a, ll b) {
return (a + b - 1) / b;
}
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp> 
// using namespace __gnu_pbds; 
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 



void solve(){
    ll n;cin>>n;
    vector<ll> v;
    for(int i=0; i<n; i++){
        ll x;cin>>x;v.push_back(x);
    }
    map<int, int> m;
    ll ans=0;
    for(int i=0; i<n; i++){
        m[v[i]]++;
        if(m[v[i]]>n/2){
            ans=v[i];
        }
    }
    if(ans){
        cout<<ans<<" "<<m[ans];
    }
    else cout<<-1;
}


int main(){
    freopen("elmaj.in", "rt", stdin);
	freopen("elmaj.out", "wt", stdout);
   ios_base::sync_with_stdio(false); cin.tie(NULL);
//    ll t;cin>>t;while(t--){solve();cout<<endl;}
    solve();
}