#include <iomanip>
#include <algorithm>
#include <numeric>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <complex>
#include <cassert>
#include <bitset>
using namespace std;

int main(int argc, const char * argv[]) {
    long n,k,m;
    cin >> n;
    vector<int> a(n);
    vector<pair<int,int>> b;
    int cnt = 1;
    cin >> a[0];
    for (int i = 1; i < n; ++i) {
        cin >> a[i];
        if (a[i] == a[i-1])
        {
        	cnt++;
        } else {
        	b.push_back(make_pair(a[i-1],cnt));
        	cnt = 1;
        }
    }
    
    return 0;
}