#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;

int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    int n;
    cin >> n;
    vector<int>vec(n + 2);
    for (int i = 0; i < n; i++) cin >> vec[i + 1];
    int db = 0;
    unordered_map<int, int>m;
    for (int i = 0; i < n + 1; i++)
    {
        if (vec[i] != vec[i + 1] && vec[i] != 0)
        {
            db++;
            m[vec[i]]++;
        }
        else if (vec[i] == 1 && vec[i + 1] == 1)
        {
            db++;
            m[vec[i]]++;
        }
    }
    int maxi = 0, mh = 0;
    for (auto i : m)
    {
        if (i.second > maxi)
        {
            maxi = i.second;
            mh = i.first;
        }
    }
    cout << db << endl << mh << endl;
    return 0;
}
/*
7
1 1 3 3 3 2 2
*/